On the public citation graph
Completeness and incompleteness for plausibility logic
0 signed · 25 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-3-642-82453-1_15openalex-snapshot
Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems
inferredcites →https://doi.org/10.1007/978-94-010-3146-2_5openalex-snapshot
An Analysis of Some Deontic Logics
inferredcites →https://doi.org/10.1016/0004-3702(85)90040-2openalex-snapshot
Saturation, nonmonotonic reasoning and the closed-world assumption
inferredcites →https://doi.org/10.1016/0004-3702(90)90101-5openalex-snapshot
Nonmonotonic reasoning, preferential models and cumulative logics
inferredcites →https://doi.org/10.1016/0004-3702(92)90041-uopenalex-snapshot
What does a conditional knowledge base entail?
inferredcites →https://doi.org/10.1093/logcom/2.6.675openalex-snapshot
Some Results on Classical Preferential Models
inferredcites →https://doi.org/10.1093/logcom/5.6.783openalex-snapshot
Preferential Choice Representation Theorems for Branching Time Structures
inferredcites →https://doi.org/10.1093/logcom/6.4.599openalex-snapshot
Some completeness results for stoppered and ranked classical preferential models
inferredcites →https://doi.org/10.1093/oso/9780198537472.003.0002openalex-snapshot
General Patterns in Nonmonotonic Reasoning
inferredcites →https://doi.org/10.3233/fi-1996-283412openalex-snapshot
A Two-Stage Approach to First Order Default Reasoning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-04407-6openalex-snapshot
Logical Tools for Handling Change in Agent-Based Systems
inferred← citeshttps://doi.org/10.1007/978-94-007-7759-0_10openalex-snapshot
Non-Monotonic Logic: Preferential Versus Algebraic Semantics
inferred← citeshttps://doi.org/10.1016/s1874-5857(07)80010-0openalex-snapshot
Nonmonotonic Logics: a Preferential Approach
inferred← citeshttps://doi.org/10.1017/s1755020308080258openalex-snapshot
CUMULATIVITY WITHOUT CLOSURE OF THE DOMAIN UNDER FINITE UNIONS
inferred← citeshttps://doi.org/10.22541/au.166603230.07636849/v1openalex-snapshot
Gödel mathematics versus Hilbert mathematics. I The Gödel incompleteness (1931) statement: axiom or theorem?
inferred← citeshttps://doi.org/10.2307/2586565openalex-snapshot
New techniques and completeness results for preferential structures
inferred← citeshttps://doi.org/10.31235/osf.io/x2sz4openalex-snapshot
Gödel mathematics versus Hilbert mathematics. I The Gödel incompleteness (1931) statement: axiom or theorem?
inferred← citeshttps://doi.org/10.3233/fi-1996-283412openalex-snapshot
A Two-Stage Approach to First Order Default Reasoning
inferred← citeshttps://doi.org/10.33774/coe-2022-wlr02openalex-snapshot
Gödel mathematics versus Hilbert mathematics. I. The Gödel incompleteness (1931) statement: axiom or theorem?
inferred← citeshttps://doi.org/10.48550/arxiv.math/0607189openalex-snapshot
Domain closure conditions and definability preservation
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.