On the public citation graph
A theory of nonmonotonic rule systems I
0 signed · 97 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_10openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.1007/978-1-4612-3466-1_17openalex-snapshot
Complexity-Theoretic Algebra: Vector Space Bases
inferredcites →https://doi.org/10.1016/0003-4843(79)90011-1openalex-snapshot
Effective content of field theory
inferredcites →https://doi.org/10.1016/0004-3702(79)90008-0openalex-snapshot
A truth maintenance system
inferredcites →https://doi.org/10.1016/0004-3702(80)90011-9openalex-snapshot
Circumscription—A form of non-monotonic reasoning
inferredcites →https://doi.org/10.1016/0004-3702(80)90014-4openalex-snapshot
A logic for default reasoning
inferredcites →https://doi.org/10.1016/0004-3702(85)90042-6openalex-snapshot
Semantical considerations on nonmonotonic logic
inferredcites →https://doi.org/10.1016/0004-3702(87)90081-6openalex-snapshot
Formalizing nonmonotonic reasoning systems
inferredcites →https://doi.org/10.1016/0004-3702(88)90021-5openalex-snapshot
On the relation between default and autoepistemic logic
inferredcites →https://doi.org/10.1016/0168-0072(86)90051-5openalex-snapshot
Graph colorings and recursively bounded Π10-classes
inferredcites →https://doi.org/10.1016/0168-0072(89)90047-xopenalex-snapshot
Complexity-theoretic algebra II: Boolean algebras
inferredcites →https://doi.org/10.1016/0890-5401(91)90073-bopenalex-snapshot
General logical databases and programs: Default logic semantics and stratification
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50006-3openalex-snapshot
Towards a Theory of Declarative Knowledge
inferredcites →https://doi.org/10.1016/b978-1-4832-1446-7.50018-2openalex-snapshot
A FRAMEWORK FOR REPRESENTING KNOWLEDGE
inferredcites →https://doi.org/10.1016/c2013-0-07699-2openalex-snapshot
Foundations of Deductive Databases and Logic Programming
inferredcites →https://doi.org/10.1016/c2013-0-08308-9openalex-snapshot
Principles of Knowledge Representation and Reasoning
inferredcites →https://doi.org/10.1090/pspum/042/791067openalex-snapshot
A survey of lattices of r.e. substructures
inferredcites →https://doi.org/10.1090/s0002-9904-1948-09098-xopenalex-snapshot
Distinct representatives of subsets
inferredcites →https://doi.org/10.1090/s0002-9947-1972-0316227-0openalex-snapshot
Π⁰₁ classes and degrees of theories
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1109/lics.1990.113736openalex-snapshot
A theory of nonmonotonic rule systems
inferredcites →https://doi.org/10.1109/psct.1987.10319273openalex-snapshot
Complexity Theoretic Algebra I: Vector Spaces over Finite Fields
inferredcites →https://doi.org/10.1112/jlms/s1-10.37.26openalex-snapshot
On Representatives of Subsets
inferredcites →https://doi.org/10.1112/plms/s3-25.4.615openalex-snapshot
Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
inferredcites →https://doi.org/10.1145/12808.12836openalex-snapshot
On the relationship between autoepistemic logic and parallel circumscription
inferredcites →https://doi.org/10.1145/800222.806735openalex-snapshot
Knowledge and common knowledge in a distributed environment
inferredcites →https://doi.org/10.2140/pjm.1969.30.67openalex-snapshot
Countable retracing functions and Π20predicates
inferredcites →https://doi.org/10.2140/pjm.1972.40.605openalex-snapshot
Degrees of members of Π10classes
inferredcites →https://doi.org/10.2307/1969503openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.3233/fi-1990-13103openalex-snapshot
Arithmetic Classification of Perfect Models of Stratified Programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-57802-1_5openalex-snapshot
Expressive power and complexity of disjunctive datalog under the stable model semantics
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_18openalex-snapshot
Default consequence relations as a logical framework for logic programs
inferred← citeshttps://doi.org/10.1007/3-540-60472-3_22openalex-snapshot
Inductive modeling: A framework marrying systems theory and non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/3-540-61532-6_47openalex-snapshot
Studying properties of classes of default logics — Preliminary report
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_22openalex-snapshot
Basic forward chaining construction for logic programs
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_19openalex-snapshot
On Proof Complexity of Circumscription
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_1openalex-snapshot
The Work of Anil Nerode: A Retrospective
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_16openalex-snapshot
Set Constraints in Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_27openalex-snapshot
Compactness Properties for Stable Semantics of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_25openalex-snapshot
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_32openalex-snapshot
Disjunctive Programs with Set Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-39617-5_10openalex-snapshot
Modeling Stable Matching Problems with Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-40381-1_7openalex-snapshot
A Formal Characterization of the Outcomes of Rule-Based Argumentation Systems
inferred← citeshttps://doi.org/10.1007/978-94-017-0456-4_3openalex-snapshot
Logics for Defeasible Argumentation
inferred← citeshttps://doi.org/10.1007/bf01530953openalex-snapshot
Preference logics: Towards a unified approach to nonmonotonicity in deductive reasoning
inferred← citeshttps://doi.org/10.1007/bf01534455openalex-snapshot
The expressiveness of locally stratified programs
inferred← citeshttps://doi.org/10.1007/bf01536399openalex-snapshot
On the computational cost of disjunctive logic programming: Propositional case
inferred← citeshttps://doi.org/10.1007/bf01536400openalex-snapshot
A topological characterization of the stable and minimal model classes of propositional logic programs
inferred← citeshttps://doi.org/10.1007/bf01543477openalex-snapshot
A theory of nonmonotonic rule systems II
inferred← citeshttps://doi.org/10.1007/bfb0021968openalex-snapshot
Revision specifications by means of programs
inferred← citeshttps://doi.org/10.1007/bfb0023319openalex-snapshot
Ranges of strong modal nonmonotonic logics
inferred← citeshttps://doi.org/10.1007/bfb0023862openalex-snapshot
Preference logics and nonmonotonicity in logic programming
inferred← citeshttps://doi.org/10.1007/bfb0035626openalex-snapshot
Non-elementary speed-ups in default reasoning
inferred← citeshttps://doi.org/10.1007/bfb0035629openalex-snapshot
Entrenchment relations: A uniform approach to nonmonotonicity
inferred← citeshttps://doi.org/10.1007/bfb0053692openalex-snapshot
Data-security in heterogeneous agent systems
inferred← citeshttps://doi.org/10.1007/s10115-018-1227-5openalex-snapshot
A formal characterization of the outcomes of rule-based argumentation systems
inferred← citeshttps://doi.org/10.1007/s10472-005-1808-3openalex-snapshot
Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
inferred← citeshttps://doi.org/10.1007/s10472-009-9107-zopenalex-snapshot
My work with Victor Marek: a mathematician looks at answer set programming
inferred← citeshttps://doi.org/10.1007/s10472-009-9109-xopenalex-snapshot
Default logic generalized and simplified
inferred← citeshttps://doi.org/10.1016/0004-3702(94)00041-xopenalex-snapshot
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
inferred← citeshttps://doi.org/10.1016/0168-0072(92)90069-copenalex-snapshot
How complicated is the set of stable models of a recursive logic program?
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90013-2openalex-snapshot
A context for belief revision: forward chaining-normal nonmonotomic rule systems
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90029-gopenalex-snapshot
A survey of complexity results for non-monotonic logics
inferred← citeshttps://doi.org/10.1016/0743-1066(95)94697-xopenalex-snapshot
An argumentation-theoretic foundation for logic programming
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.04.008openalex-snapshot
Reasoning with power defaults
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00015-5openalex-snapshot
An abstract, argumentation-theoretic approach to default reasoning
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80046-3openalex-snapshot
Chapter 13 Π10 classes in mathematics
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00064-7openalex-snapshot
The complexity of predicate default logic over a countable domain
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00041-4openalex-snapshot
Logic programs, well-orderings and forward chaining
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00127-2openalex-snapshot
Annotated nonmonotonic rule systems
inferred← citeshttps://doi.org/10.1016/s0743-1066(14)80008-3openalex-snapshot
The Stable Models of a Predicate Logic Program
inferred← citeshttps://doi.org/10.1017/s147106841600003xopenalex-snapshot
Solving stable matching problems using answer set programming
inferred← citeshttps://doi.org/10.1023/a:1018988629376openalex-snapshot
Nonmonotonic consequences in default domain theory
inferred← citeshttps://doi.org/10.1023/b:amai.0000012868.41613.e7openalex-snapshot
Locally Determined Logic Programs and Recursive Stable Models
inferred← citeshttps://doi.org/10.1080/095281398146725openalex-snapshot
Studying properties of classes of default logics
inferred← citeshttps://doi.org/10.1109/icips.1997.669169openalex-snapshot
Sequence of knowledge bases and evaluating revision approximately
inferred← citeshttps://doi.org/10.1109/lics.1990.113736openalex-snapshot
A theory of nonmonotonic rule systems
inferred← citeshttps://doi.org/10.1109/lics.1995.523255openalex-snapshot
Complexity of normal default logic and related modes of nonmonotonic reasoning
inferred← citeshttps://doi.org/10.1145/195613.195637openalex-snapshot
Mixed integer programming methods for computing nonmonotonic deductive databases
inferred← citeshttps://doi.org/10.1145/199448.199513openalex-snapshot
Default timed concurrent constraint programming
inferred← citeshttps://doi.org/10.1145/377978.377987openalex-snapshot
Proof-complexity results for nonmonotonic reasoning
inferred← citeshttps://doi.org/10.22029/jlupub-7003openalex-snapshot
Preferred answer sets for extended logic programs
inferred← citeshttps://doi.org/10.2307/2687767openalex-snapshot
2000-2001 Winter Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/2687834openalex-snapshot
2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000
inferred← citeshttps://doi.org/10.2307/421070openalex-snapshot
2000 Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/421093openalex-snapshot
1998–1999 Winter Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.23861/ejbm20112716openalex-snapshot
Cognition without a Neural Code: How a Folded Cortex Might Think by Harmonizing Its Own Electromagnetic Fields
inferred← citeshttps://doi.org/10.3233/fi-1994-2144openalex-snapshot
THE COMPLEXITY OF LOCAL STRATIFICATION
inferred← citeshttps://doi.org/10.48550/arxiv.1302.7251openalex-snapshot
Modeling Stable Matching Problems with Answer Set Programming
inferred← citeshttps://doi.org/10.70675/e30888e1za10cz4e58z9812z4826cb8de462openalex-snapshot
Modélisation du comportement humain dans les simulations de combat naval
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.