A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs.
Douglas CenzerJeffrey B. RemmelPublished in: Ann. Math. Artif. Intell. (2012)
Keyphrases
- logic programs
- function symbols
- logic programming
- fixpoint
- stable models
- background knowledge
- answer set programming
- answer sets
- computational properties
- normal logic programs
- inductive logic programming
- recursive programs
- answer set programs
- monotonicity constraints
- prolog programs
- partial deduction
- high level
- term rewriting systems
- strong equivalence
- autoepistemic logic
- object oriented