A theory of nonmonotonic rule systems I

DOI10.1007/BF01531080zbMATH Open0878.68035OpenAlexW3160286556MaRDI QIDQ1356221FDOQ1356221

Wiktor Marek, Anil Nerode, Jeffrey Remmel

Publication date: 14 December 1997

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

Full work available at URL: https://doi.org/10.1007/bf01531080

zbMATH Keywords

nonmonotonic rule systems

Mathematics Subject Classification ID

Logic programming (68N17) Logic in computer science (03B70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Paraconsistent logic programming
• On Representatives of Subsets
• Effective content of field theory
• A decomposition theorem for partially ordered sets
• A logic for default reasoning
• Semantical considerations on nonmonotonic logic
• Circumscription - a form of non-monotonic reasoning
• Distinct representatives of subsets
• On the relation between default and autoepistemic logic
• General logical databases and programs: Default logic semantics and stratification
• Complexity-theoretic algebra. II: Boolean algebras

Cited In (23)

• Default consequence relations as a logical framework for logic programs
• Reasoning with power defaults
• Studying properties of classes of default logics
• 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000. La Sorbonne, Paris, France, July 23-31, 2000
• How complicated is the set of stable models of a recursive logic program?
• A context for belief revision: forward chaining-normal nonmonotonic rule systems
• My work with Victor Marek: a mathematician looks at answer set programming
• A theory of nonmonotonic rule systems. II
• 1998–1999 Winter Meeting of the Association for Symbolic Logic
• The expressiveness of locally stratified programs
• Logic programs, well-orderings, and forward chaining
• An abstract, argumentation-theoretic approach to default reasoning
• Disjunctive Programs with Set Constraints
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• 2000-2001 Winter Meeting of the Association for Symbolic Logic. Sheraton New Orleans Hotel, New Orleans, Louisiana, January 12-13, 2001
• On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
• Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
• Annotated nonmonotonic rule systems
• The complexity of predicate default logic over a countable domain
• Default logic generalized and simplified
• 2000 Annual Meeting of the Association for Symbolic Logic
• Nonmonotonic rule systems with recursive sets of restraints
• Solving stable matching problems using answer set programming

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Annotated nonmonotonic rule systems 👍 👎
• A logic of non-monotonic interactions 👍 👎
• A theory of nonmonotonic rule systems. II 👍 👎
• Nonmonotonic rule systems with recursive sets of restraints 👍 👎
• Formalizing nonmonotonic reasoning systems 👍 👎

This page was built for publication: A theory of nonmonotonic rule systems I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356221)