Equivalence of two fixed-point semantics for definitional higher-order logic programs.
Angelos CharalambidisPanos RondogiannisIoanna SymeonidouPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- logic programs
- fixed point semantics
- higher order
- strong equivalence
- answer set semantics
- logic programming
- answer sets
- stable models
- fixpoint
- background knowledge
- answer set programming
- inductive logic programming
- partial deduction
- computational properties
- stable model semantics
- normal logic programs
- semantics for logic programs
- horn clauses
- datalog programs