Logic programs, well-orderings, and forward chaining
From MaRDI portal
Publication:1295428
DOI10.1016/S0168-0072(98)00041-4zbMath0927.68021MaRDI QIDQ1295428
Anil Nerode, Jeffery B. Remmel, Victor W. Marek
Publication date: 24 June 1999
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Related Items
Disjunctive Programs with Set Constraints ⋮ Forward Chaining for Hybrid ASP ⋮ Characterization of an auto-compatible default theory ⋮ Logic programs with abstract constraint atoms: the role of computations ⋮ My work with Victor Marek: a mathematician looks at answer set programming ⋮ Consistency properties and set based logic programming ⋮ Semi-equilibrium models for paracoherent answer set programs
Cites Work
- A logic for default reasoning
- Non-monotonic logic. I
- A context for belief revision: forward chaining-normal nonmonotonic rule systems
- A theory of nonmonotonic rule systems. II
- A theory of nonmonotonic rule systems I
- Fixpoint semantics for logic programming a survey
- Degrees of members of \(\Pi_ 1^ 0\) classes
- A kripke-kleene semantics for logic programs*
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Negation in logic programming
- Nonmonotonic Logic II
- Contributions to the Theory of Logic Programming
- Autoepistemic logic
- The well-founded semantics for general logic programs
- The Stable Models of a Predicate Logic Program
- ∏ 0 1 Classes and Degrees of Theories
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item