A theory of nonmonotonic rule systems I
From MaRDI portal
Publication:1356221
DOI10.1007/BF01531080zbMath0878.68035OpenAlexW3160286556MaRDI QIDQ1356221
Victor W. Marek, Jeffery B. 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
Related Items (22)
A context for belief revision: forward chaining-normal nonmonotonic rule systems ⋮ 2000 Annual Meeting of the Association for Symbolic Logic ⋮ Reasoning with power defaults ⋮ 1998–1999 Winter Meeting of the Association for Symbolic Logic ⋮ Disjunctive Programs with Set Constraints ⋮ A theory of nonmonotonic rule systems. II ⋮ The expressiveness of locally stratified programs ⋮ Default consequence relations as a logical framework for logic programs ⋮ Solving stable matching problems using answer set programming ⋮ An abstract, argumentation-theoretic approach to default reasoning ⋮ 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000 ⋮ Annotated nonmonotonic rule systems ⋮ How complicated is the set of stable models of a recursive logic program? ⋮ Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics ⋮ Studying properties of classes of default logics ⋮ 2000-2001 Winter Meeting of the Association for Symbolic Logic ⋮ My work with Victor Marek: a mathematician looks at answer set programming ⋮ Default logic generalized and simplified ⋮ Logic programs, well-orderings, and forward chaining ⋮ On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP ⋮ On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games ⋮ The complexity of predicate default logic over a countable domain
Cites Work
- Complexity-theoretic algebra. II: Boolean algebras
- Semantical considerations on nonmonotonic logic
- On the relation between default and autoepistemic logic
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- General logical databases and programs: Default logic semantics and stratification
- Paraconsistent logic programming
- A decomposition theorem for partially ordered sets
- Effective content of field theory
- On Representatives of Subsets
- Distinct representatives of subsets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A theory of nonmonotonic rule systems I
