A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
From MaRDI portal
Publication:1926591
DOI10.1007/s10472-012-9294-xzbMath1281.68063MaRDI QIDQ1926591
Douglas Cenzer, Jeffery B. Remmel
Publication date: 28 December 2012
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-012-9294-x
68T27: Logic in artificial intelligence
68N17: Logic programming
54B99: Basic constructions in general topology
Related Items
Index Sets for Finite Normal Predicate Logic Programs with Function Symbols, A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The alternating fixpoint of logic programs with negation
- Members of countable \(\Pi ^ 0_ 1\) classes
- Index sets for \(\Pi^0_1\) classes
- Fixpoint semantics for logic programming a survey
- Effectively closed sets and graphs of computable real functions.
- The expressive powers of the logic programming semantics
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
- A lattice-theoretical fixpoint theorem and its applications
- On the Borel class of the derived set operator. II
- On the Borel class of the derived set operator
- Hyperarithmetical Index Sets in Recursion Theory
- The well-founded semantics for general logic programs
- The Stable Models of a Predicate Logic Program
- Logic programming revisited
