Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop.
Michael CodishBart DemoenPublished in: ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages (1994)
Keyphrases
- logic programs
- logic programming
- answer sets
- background knowledge
- answer set programming
- fixpoint
- inside outside algorithm
- term rewriting systems
- computational properties
- prolog programs
- stable models
- inductive logic programming
- strong equivalence
- partial deduction
- logic program updates
- monotonicity constraints
- stable model semantics
- normal logic programs
- existentially quantified