On the public citation graph

Tableaux and sequent calculus for minimal entailment

https://doi.org/10.1007/bf00247828
0 signed · 50 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_21openalex-snapshot
Compiling circumscriptive theories into logic programs
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
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-642-86718-7openalex-snapshot
First-Order Logic
inferredcites →https://doi.org/10.1007/978-94-017-2045-8_11openalex-snapshot
Model Minimization — An Alternative to Circumscription
inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot
On indefinite databases and the closed world assumption
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(85)90040-2openalex-snapshot
Saturation, nonmonotonic reasoning and the closed-world assumption
inferredcites →https://doi.org/10.1016/0004-3702(85)90055-4openalex-snapshot
Closed-world databases and circumscription
inferredcites →https://doi.org/10.1016/0004-3702(86)90029-9openalex-snapshot
Completeness results for circumscription
inferredcites →https://doi.org/10.1016/0004-3702(86)90032-9openalex-snapshot
Applications of circumscription to formalizing common-sense knowledge
inferredcites →https://doi.org/10.1016/0004-3702(89)90018-0openalex-snapshot
Eliminating the fixed predicates from a circumscription
inferredcites →https://doi.org/10.1016/0004-3702(89)90067-2openalex-snapshot
An algorithm to compute circumscription
inferredcites →https://doi.org/10.1016/0004-3702(89)90068-4openalex-snapshot
On the relationship between circumscription and negation as failure
inferredcites →https://doi.org/10.1016/0743-1066(85)90018-4openalex-snapshot
Negation as failure. II

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-48754-9_9openalex-snapshot
Merge Path Improvements for Minimal Model Hyper Tableaux
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_3openalex-snapshot
Disjunctive Logic Program = Horn Program + Control Program
inferred← citeshttps://doi.org/10.1007/3-540-58467-6_26openalex-snapshot
A note on tableaux of logic of paradox
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_10openalex-snapshot
Minimal model generation with positive unit hyper-resolution tableaux
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_18openalex-snapshot
A tableau calculus for minimal model reasoning
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_9openalex-snapshot
Sequent calculi for default and autoepistemic logics
inferred← citeshttps://doi.org/10.1007/3-540-61291-2_60openalex-snapshot
Paraconsistent circumscription
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_6openalex-snapshot
A uniform tableaux method for nonmonotonic modal logics
inferred← citeshttps://doi.org/10.1007/3-540-63576-9_110openalex-snapshot
A proof theory for tractable approximations of propositional reasoning
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_19openalex-snapshot
On Proof Complexity of Circumscription
inferred← citeshttps://doi.org/10.1007/3540634932_7openalex-snapshot
Minimal model generation based on E-hyper tableaux
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_32openalex-snapshot
The Complexity of Theorem Proving in Circumscription and Minimal Entailment
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_11openalex-snapshot
A Bibliography on Analytic Tableaux Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_8openalex-snapshot
Tableaux for Nonmonotonic Logics
inferred← citeshttps://doi.org/10.1007/bf00881950openalex-snapshot
A tableau prover for domain minimization
inferred← citeshttps://doi.org/10.1007/bf00881957openalex-snapshot
Tableau-based characterization and theorem proving for default logic
inferred← citeshttps://doi.org/10.1007/bfb0027408openalex-snapshot
A sequent calculus for skeptical Default Logic
inferred← citeshttps://doi.org/10.1007/bfb0028009openalex-snapshot
A sequent calculus for circumscription
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/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.1017/9781316718254.008openalex-snapshot
Labelled deductive systems: a position paper
inferred← citeshttps://doi.org/10.1017/s0269888909990282openalex-snapshot
Diagnosing Coordination Faults in Multi-Agent Systems
inferred← citeshttps://doi.org/10.1023/a:1006291616338openalex-snapshot
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
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.1023/a:1026153912205openalex-snapshot
Database Repairs and Analytic Tableaux
inferred← citeshttps://doi.org/10.1109/bicta.2007.4806413openalex-snapshot
Using Tableaux Method to Represent Inconsistent Knowledge of Deep Web
inferred← citeshttps://doi.org/10.1109/ismvl.1995.513539openalex-snapshot
On logic of paradox
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.48550/arxiv.1405.1565openalex-snapshot
Tableau vs. Sequent Calculi for Minimal Entailment
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.