Preserving Termination of Tabled Logic Programs While Unfolding.
Michael LeuschelBern MartensKonstantinos SagonasPublished in: LOPSTR (1997)
Keyphrases
- logic programs
- logic programming
- fixpoint
- background knowledge
- answer sets
- answer set programming
- stable models
- normal logic programs
- inductive logic programming
- partial deduction
- computational properties
- stable model semantics
- term rewriting systems
- horn clauses
- monotonicity constraints
- strong equivalence
- logic program updates
- declarative semantics
- prolog programs
- propositional theories
- recursive programs
- deductive databases