On the public citation graph

Plausibility logic

https://doi.org/10.1007/bfb0023770
0 signed · 28 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/3-540-50701-9_16openalex-snapshot
General theory of cumulative inference
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.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.1016/0004-3702(94)90073-6openalex-snapshot
What does a conditional knowledge base entail?
inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1016/0890-5401(91)90023-uopenalex-snapshot
Simple consequence relations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11853886_22openalex-snapshot
A Fault-Tolerant Default Logic
inferred← citeshttps://doi.org/10.1007/3-540-48747-6_2openalex-snapshot
Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations
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/bf00173699openalex-snapshot
Completeness and incompleteness for plausibility logic
inferred← citeshttps://doi.org/10.1007/bf00215626openalex-snapshot
Reasoning with logical bilattices
inferred← citeshttps://doi.org/10.1007/bf01054708openalex-snapshot
Nonmonotonic reasoning: from finitary relations to infinitary inference operations
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00032-0openalex-snapshot
The value of the four values
inferred← citeshttps://doi.org/10.1016/s1570-2464(04)80020-xopenalex-snapshot
Preferences
inferred← citeshttps://doi.org/10.1016/s1570-2464(04)80027-2openalex-snapshot
Bibliography
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.1023/a:1006020529663openalex-snapshot
A Model-Theoretic Approach for Recovering Consistent Data from Inconsistent Knowledge Bases
inferred← citeshttps://doi.org/10.1080/11663081.1997.10510917openalex-snapshot
Local possibilistic logic
inferred← citeshttps://doi.org/10.1093/jigpal/8.2.119openalex-snapshot
General patterns for nonmonotonic reasoning: from basic entailments to plausible relations
inferred← citeshttps://doi.org/10.1109/lics.1994.316044openalex-snapshot
Logical bilattices and inconsistent data
inferred← citeshttps://doi.org/10.1109/lics.1998.705648openalex-snapshot
The logical role of the four-valued bilattice
inferred← citeshttps://doi.org/10.1109/micai.2006.48openalex-snapshot
Update Sequences in Generalised Answer Set Programming Based on Structural Properties
inferred← citeshttps://doi.org/10.1111/0824-7935.00037openalex-snapshot
What Should Default Reasoning be, by Default?
inferred← citeshttps://doi.org/10.3233/fi-1996-283412openalex-snapshot
A Two-Stage Approach to First Order Default Reasoning
inferred← citeshttps://doi.org/10.48550/arxiv.1302.4931openalex-snapshot
An Algebraic Semantics for Possibilistic Logic
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.