Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems.
Harald GanzingerUwe WaldmannPublished in: CTRS (1992)
Keyphrases
- rewrite systems
- logic programs
- prolog programs
- term rewriting
- theorem prover
- theorem proving
- logic programming
- active rules
- answer sets
- fixpoint
- stable models
- background knowledge
- answer set programming
- partial deduction
- computational properties
- inference rules
- first order logic
- normal logic programs
- stochastic logic programs
- inductive logic programming
- control flow
- horn clauses
- nonmonotonic reasoning
- machine learning