English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Termination Proofs of Well-Moded Logic Programs Via Conditional Rewrite Systems

MPS-Authors
/persons/resource/persons44474

Ganzinger,  Harald
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45689

Waldmann,  Uwe       
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dtn5H
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Ganzinger, H., & Waldmann, U. (1992). Termination Proofs of Well-Moded Logic Programs Via Conditional Rewrite Systems. In M. Rusinowitch, & J.-L. Rémy (Eds.), Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems '92 (pp. 430-437). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AE21-7
Abstract
In this paper, it is shown that a translation from logic programs to
conditional rewrite rules can be used in a straightforward way to check
(semi-automatically) whether a program is terminating under the prolog
selection rule.