Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping.
Jan-Georg SmausFrançois FagesPierre DeransartPublished in: FSTTCS (2000)
Keyphrases
- logic programs
- logic programming
- answer sets
- fixpoint
- stable models
- background knowledge
- answer set programming
- inductive logic programming
- partial deduction
- prolog programs
- computational properties
- normal logic programs
- stable model semantics
- term rewriting systems
- declarative semantics
- general purpose
- existentially quantified
- definite clause
- strong equivalence
- deductive databases