Proving Termination of Logic Programs by Exploiting Term Properties.
Annalisa BossiNicoletta CoccoMassimo FabrisPublished in: TAPSOFT, Vol.2 (1991)
Keyphrases
- logic programs
- logic programming
- answer sets
- answer set programming
- term rewriting systems
- stable models
- fixpoint
- background knowledge
- partial deduction
- computational properties
- normal logic programs
- answer set programs
- stable model semantics
- logic program updates
- recursive programs
- existentially quantified
- answer set semantics
- inductive logic programming
- desirable properties
- monotonicity constraints
- programming language
- model checking
- nonmonotonic reasoning
- default logic