A Finite Presentation Theorem for Approximating Logic Programs.
Nevin HeintzeJoxan JaffarPublished in: POPL (1990)
Keyphrases
- logic programs
- function symbols
- logic programming
- valued logic
- answer sets
- fixpoint
- answer set programming
- stable models
- background knowledge
- partial deduction
- inductive logic programming
- term rewriting systems
- prolog programs
- computational properties
- normal logic programs
- stable model semantics
- functional programs
- strong equivalence
- deductive databases
- data model
- logic program updates