On the public citation graph
Model minimization ?An alternative to circumscription
0 signed · 22 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 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-54563-8_117openalex-snapshot
Nonmonotonic temporal reasoning: Persistence, justified causation and event minimization
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-61291-2_60openalex-snapshot
Paraconsistent circumscription
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_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/bfb0027015openalex-snapshot
Model generation with existentially quantified variables and constraints
inferred← citeshttps://doi.org/10.1007/bfb0043088openalex-snapshot
Incremental models of updating data bases
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.1109/ismvl.1991.130735openalex-snapshot
Improving tableau deductions in multiple-valued logics
inferred← citeshttps://doi.org/10.29007/5bvpopenalex-snapshot
A note on first-order reasoning for minimum models
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.