On the public citation graph
A tableau prover for domain minimization
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.
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/3-540-54563-8_117openalex-snapshot
Nonmonotonic temporal reasoning: Persistence, justified causation and event minimization
inferredcites →https://doi.org/10.1007/3-540-55602-8_188openalex-snapshot
An improved method for adding equality to free variable semantic tableaux
inferredcites →https://doi.org/10.1007/978-1-4612-2360-3openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-1-4684-0357-2openalex-snapshot
First-Order Logic and Automated Theorem Proving
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/bf00244510openalex-snapshot
Model minimization ?An alternative to circumscription
inferredcites →https://doi.org/10.1007/bf00244513openalex-snapshot
HARP: A tableau-based theorem prover
inferredcites →https://doi.org/10.1007/bf00247828openalex-snapshot
Tableaux and sequent calculus for minimal entailment
inferredcites →https://doi.org/10.1007/bf00881837openalex-snapshot
First-order syntactic characterizations of minimal entailment, domain-minimal entailment, and Herbrand entailment
inferredcites →https://doi.org/10.1007/bf00881956openalex-snapshot
The liberalized ?-rule in free variable semantic tableaux
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)90013-2openalex-snapshot
The mathematics of non-monotonic reasoning
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(87)90081-6openalex-snapshot
Formalizing nonmonotonic reasoning systems
inferredcites →https://doi.org/10.1016/0004-3702(89)90026-xopenalex-snapshot
A circumscriptive theorem prover
inferredcites →https://doi.org/10.1016/0004-3702(89)90067-2openalex-snapshot
An algorithm to compute circumscription
inferredcites →https://doi.org/10.1016/0304-3975(94)90089-2openalex-snapshot
On the relative merits of path dissolution and the method of analytic tableaux
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50035-0openalex-snapshot
EPISTEMOLOGICAL PROBLEMS OF ARTIFICIAL INTELLIGENCE
inferredcites →https://doi.org/10.1111/j.1467-8640.1985.tb00055.xopenalex-snapshot
On the adequacy of predicate circumscription for closed‐world reasoning
inferredcites →https://doi.org/10.1111/j.1467-8640.1987.tb00177.xopenalex-snapshot
Domain circumscription: a reevaluation
inferredcites →https://doi.org/10.21236/ada086574openalex-snapshot
Circumscription - A Form of Non-Monotonic 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/3-540-49545-2_9openalex-snapshot
A Deduction Method Complete for Refutation and Finite Satisfiability
inferred← citeshttps://doi.org/10.1007/3-540-61313-7_65openalex-snapshot
General domain circumscription and its first-order reduction
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_30openalex-snapshot
Terminating Minimal Model Generation Procedures for Propositional Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-319-66902-1_12openalex-snapshot
Minimisation of ATL $$^*$$ ∗ Models
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_15openalex-snapshot
A More Efficient Tableaux Procedure for Simultaneous Search for Refutations and Finite Models
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_20openalex-snapshot
Computing Minimal Models Modulo Subset-Simulation for Modal Logics
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/s10817-019-09515-1openalex-snapshot
Blocking and Other Enhancements for Bottom-Up Model Generation Methods
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.10.013openalex-snapshot
A Tableau Calculus for Minimal Modal Model Generation
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:1017916706972openalex-snapshot
Towards the Use of Automated Reasoning in Discourse Disambiguation
inferred← citeshttps://doi.org/10.1093/jigpal/11.4.435openalex-snapshot
Resource-Adaptive Model Generation as a Performance Model
inferred← citeshttps://doi.org/10.1184/r1/6492035openalex-snapshot
Interpreting Negatives in Discourse
inferred← citeshttps://doi.org/10.24963/ijcai.2019/232openalex-snapshot
An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic
inferred← citeshttps://doi.org/10.3233/fi-1998-3612openalex-snapshot
General Domain Circumscription and its Effective Reductions
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.