A theory of nonmonotonic rule systems. II

DOI10.1007/BF01543477zbMath0865.03017MaRDI QIDQ1354038

Anil Nerode, Victor W. Marek, Jeffery B. Remmel

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

algorithms; nonmonotonic logic; semantics; syntax; nonmonotonic rule systems; metatheorems

Mathematics Subject Classification ID

03B60: Other nonclassical logic

68T27: Logic in artificial intelligence

Related Items

2000 Annual Meeting of the Association for Symbolic Logic, On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP, 2000-2001 Winter Meeting of the Association for Symbolic Logic, Annotated nonmonotonic rule systems, How complicated is the set of stable models of a recursive logic program?, Logic programs, well-orderings, and forward chaining, A context for belief revision: forward chaining-normal nonmonotonic rule systems, An abstract, argumentation-theoretic approach to default reasoning, The complexity of predicate default logic over a countable domain, 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

Cites Work

• 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
• Unnamed Item
• Unnamed Item