A theory of nonmonotonic rule systems. II
From MaRDI portal
Publication:1354038
DOI10.1007/BF01543477zbMath0865.03017OpenAlexW4238881545MaRDI QIDQ1354038
Jeffery B. Remmel, Victor W. Marek
Publication date: 13 May 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01543477
Related Items (13)
A context for belief revision: forward chaining-normal nonmonotonic rule systems ⋮ 2000 Annual Meeting of the Association for Symbolic Logic ⋮ Complexity and undecidability results for logic programming ⋮ On the computational cost of disjunctive logic programming: Propositional case ⋮ A topological characterization of the stable and minimal model classes of propositional logic programs ⋮ An abstract, argumentation-theoretic approach to default reasoning ⋮ Annotated nonmonotonic rule systems ⋮ How complicated is the set of stable models of a recursive logic program? ⋮ 2000-2001 Winter Meeting of the Association for Symbolic Logic ⋮ My work with Victor Marek: a mathematician looks at answer set programming ⋮ Logic programs, well-orderings, and forward chaining ⋮ On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP ⋮ The complexity of predicate default logic over a countable domain
Cites Work
- Unnamed Item
- Unnamed Item
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
- Formalizing nonmonotonic reasoning systems
- A logic for default reasoning
- How complicated is the set of stable models of a recursive logic program?
- A theory of nonmonotonic rule systems I
- Countable retracing functions and \(\Pi_2^0\) predicates
- Degrees of members of \(\Pi_ 1^ 0\) classes
- A decomposition theorem for partially ordered sets
- Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
- ∏ 0 1 Classes and Degrees of Theories
This page was built for publication: A theory of nonmonotonic rule systems. II
