On the public citation graph

A theory of nonmonotonic rule systems II

https://doi.org/10.1007/bf01543477
0 signed · 37 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-86718-7openalex-snapshot
First-Order Logic
inferredcites →https://doi.org/10.1007/bf01531080openalex-snapshot
A theory of nonmonotonic rule systems I
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(87)90081-6openalex-snapshot
Formalizing nonmonotonic reasoning systems
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(92)90069-copenalex-snapshot
How complicated is the set of stable models of a recursive logic program?
inferredcites →https://doi.org/10.1016/c2013-0-08308-9openalex-snapshot
Principles of Knowledge Representation and Reasoning
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/116825.116836openalex-snapshot
Autoepistemic logic
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.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.1002/047134608x.w4310openalex-snapshot
Deductive Databases
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-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-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-94-017-0456-4_3openalex-snapshot
Logics for Defeasible Argumentation
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/bfb0035626openalex-snapshot
Non-elementary speed-ups in default reasoning
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.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/s0004-3702(97)00015-5openalex-snapshot
An abstract, argumentation-theoretic approach to default reasoning
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.1023/b:amai.0000012868.41613.e7openalex-snapshot
Locally Determined Logic Programs and Recursive Stable Models
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.1995.523255openalex-snapshot
Complexity of normal default logic and related modes of nonmonotonic reasoning
inferred← citeshttps://doi.org/10.1145/377978.377987openalex-snapshot
Proof-complexity results for nonmonotonic reasoning
inferred← citeshttps://doi.org/10.2307/2687767openalex-snapshot
2000-2001 Winter Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/421070openalex-snapshot
2000 Annual Meeting of the Association for Symbolic Logic
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.