On the public citation graph

A sequent calculus for skeptical Default Logic

https://doi.org/10.1007/bfb0027408
0 signed · 54 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-9openalex-snapshot
Non-Monotonic Reasoning
inferredcites →https://doi.org/10.1007/3-540-50701-9_16openalex-snapshot
General theory of cumulative inference
inferredcites →https://doi.org/10.1007/3-540-51498-8_33openalex-snapshot
An extended framework for default reasoning
inferredcites →https://doi.org/10.1007/3-540-61208-4_9openalex-snapshot
Sequent calculi for default and autoepistemic logics
inferredcites →https://doi.org/10.1007/978-3-642-60211-5_11openalex-snapshot
Toward Efficient Default Reasoning
inferredcites →https://doi.org/10.1007/978-3-642-82453-1openalex-snapshot
Logics and Models of Concurrent Systems
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-3-662-02906-0openalex-snapshot
Nonmonotonic Logic
inferredcites →https://doi.org/10.1007/bf00247828openalex-snapshot
Tableaux and sequent calculus for minimal entailment
inferredcites →https://doi.org/10.1007/bf00370199openalex-snapshot
The method of axiomatic rejection for the intuitionistic propositional logic
inferredcites →https://doi.org/10.1007/bf00881832openalex-snapshot
A new methodology for query answering in default logics via structure-oriented theorem proving
inferredcites →https://doi.org/10.1007/bf00881911openalex-snapshot
Autoepistemic logic programming
inferredcites →https://doi.org/10.1007/bf00881957openalex-snapshot
Tableau-based characterization and theorem proving for default logic
inferredcites →https://doi.org/10.1007/bf00883932openalex-snapshot
Embedding defaults into terminological knowledge representation formalisms
inferredcites →https://doi.org/10.1007/bf02121863openalex-snapshot
Theory of rejected propositions. I
inferredcites →https://doi.org/10.1007/bfb0012865openalex-snapshot
Decision procedure for autoepistemic logic
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(88)90021-5openalex-snapshot
On the relation between default and autoepistemic logic
inferredcites →https://doi.org/10.1016/0004-3702(89)90026-xopenalex-snapshot
A circumscriptive theorem prover
inferredcites →https://doi.org/10.1016/0004-3702(90)90056-6openalex-snapshot
All I know: A study in autoepistemic logic
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(91)90099-6openalex-snapshot
Cumulative default logic
inferredcites →https://doi.org/10.1016/0020-0271(72)90029-0openalex-snapshot
Computers and artificial intelligence
inferredcites →https://doi.org/10.1016/b978-1-4832-1452-8.50103-2openalex-snapshot
On the Relation Between Default and Modal Consequence Relations
inferredcites →https://doi.org/10.1093/logcom/6.2.205openalex-snapshot
A proof theoretical approach to default reasoning I: tableaux for default logic
inferredcites →https://doi.org/10.1109/lics.1988.5097openalex-snapshot
Proving unprovability
inferredcites →https://doi.org/10.1145/137097.137892openalex-snapshot
Implementing deductive databases by linear programming
inferredcites →https://doi.org/10.1305/ndjfl/1093888218openalex-snapshot
A formal system for the non-theorems of the propositional calculus.
inferredcites →https://doi.org/10.1515/krt-1992-010406openalex-snapshot
Complementary Logics for Classical Propositional Languages
inferredcites →https://doi.org/10.18778/0138-0680openalex-snapshot
Bulletin of the Section of Logic
inferredcites →https://doi.org/10.22028/d291-24896openalex-snapshot
Embedding defaults into terminological knowledge representation formalisms
inferredcites →https://doi.org/10.2307/2182523openalex-snapshot
Aristotle's Syllogistic from the Standpoint of Modern Formal Logic.
inferredcites →https://doi.org/10.2307/2963556openalex-snapshot
Dana Scott. Completeness proofs for the intuitionistic sentential calculus. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 231–241.
inferredcites →https://doi.org/10.7551/mitpress/4307.003.0006openalex-snapshot
Implementing Stable Semantics by Linear Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722086_28openalex-snapshot
A Tableau Calculus for Equilibrium Entailment
inferred← citeshttps://doi.org/10.1007/10722086_30openalex-snapshot
Tableau Calculus for Only Knowing and Knowing At Most
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_13openalex-snapshot
Resolution for skeptical stable semantics
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-319-24312-2_2openalex-snapshot
A Propositional Tableaux Based Proof Calculus for Reasoning with Default Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-87803-2_34openalex-snapshot
Rule Calculus: Semantics, Axioms and Applications
inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_8openalex-snapshot
Some Strengths of Nonmonotonic Reasoning
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_8openalex-snapshot
Tableaux for Nonmonotonic Logics
inferred← citeshttps://doi.org/10.1007/bfb0028009openalex-snapshot
A sequent calculus for circumscription
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50021-7openalex-snapshot
Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations
inferred← citeshttps://doi.org/10.1016/j.artint.2004.02.001openalex-snapshot
Reasoning with infinite stable models
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00060-6openalex-snapshot
Alternative foundations for Reiter's default logic
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03006-4openalex-snapshot
Chapter 6 Nonmonotonic Reasoning
inferred← citeshttps://doi.org/10.1017/s1471068405002528openalex-snapshot
Graphs and colorings for answer set programming
inferred← citeshttps://doi.org/10.1023/a:1011960831261openalex-snapshot
Resolution for Skeptical Stable Model Semantics
inferred← citeshttps://doi.org/10.1023/a:1013894629540openalex-snapshot
A Sound and Complete Tableau Calculus for Reasoning about only Knowing and Knowing at Most
inferred← citeshttps://doi.org/10.1145/377978.377987openalex-snapshot
Proof-complexity results for nonmonotonic reasoning
inferred← citeshttps://doi.org/10.1145/505372.505374openalex-snapshot
Sequent calculi for propositional nonmonotonic logics
inferred← citeshttps://doi.org/10.17771/pucrio.acad.65956openalex-snapshot
LAW AND ORDER(ING): PROVIDING A NATURAL DEDUCTION SYSTEM AND NON-MONOTONIC REASONING TO AN INTUITIONISTIC DESCRIPTION LOGIC
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.