VOLUME 11 2006 NUMBER 1

Basic Rewriting via Logic Programming, with an Application to the Reachability Problem
Sébastien Limet, Gernot Salzer
Pages 107–142





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2006-107,
  author  = {S{\'{e}}bastien Limet and Gernot Salzer},
  title   = {Basic Rewriting via Logic Programming, with an Application to the Reachability Problem},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {11},
  number  = {1},
  pages   = {107--142},
  year    = {2006},
  url     = {https://doi.org/10.25596/jalc-2006-107},
  doi     = {10.25596/jalc-2006-107}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: tree languages, term rewriting, logic programming, formal verification, reachability
DOI: 10.25596/jalc-2006-107