@InProceedings{KulasM:rewps,
  author = 	 {M.~Kula\v{s}},
  title = 	 {A Rewriting {P}rolog Semantics},
  booktitle = 	 {Proc. of the CL'2000 Workshop on Verification and Computational 
Logic (VCL'2000), London},
  editor = 	 {M.~Leuschel and A.~Podelski and C.\,R.~Ramakrishnan and U.~Ultes-Nitsche},
  year = 	 {2000},
  note = 	 {Southampton University Tech. Report DSSE-TR-2000-6, 
\href{http://www.ecs.soton.ac.uk/~mal/vcl2000.html}{http://www.ecs.soton.ac.uk/\~{}mal/vcl2000.html}},
  url={http://www.ecs.soton.ac.uk/~mal/vcl2000.html},
abstract={We introduce a lean and intuitive operational semantics of a
characteristic subset of Standard Prolog (the whole logic and control,
database updates and solution collecting). The Prolog computation is
modelled as conditional rewriting of derivation states. Due to a novel
linear representation of the Prolog tree traversal, our approach is
especially suitable for modelling the control flow. The semantics is
fully operational and implemented in Prolog. }  }