Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs.
Angelos CharalambidisPanos RondogiannisIoanna SymeonidouPublished in: FICS (2015)
Keyphrases
- logic programs
- fixed point semantics
- higher order
- strong equivalence
- answer set semantics
- logic programming
- answer sets
- fixpoint
- answer set programming
- stable models
- background knowledge
- semantics for logic programs
- computational properties
- normal logic programs
- inductive logic programming
- partial deduction
- stable model semantics
- datalog programs
- horn clauses