On the public citation graph

Tableau-based characterization and theorem proving for default logic

https://doi.org/10.1007/bf00881957

0 signed · 56 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-16780-3_92openalex-snapshot

A commonsense theory of nonmonotonic reasoning

inferredcites →https://doi.org/10.1007/3-540-52885-7_112openalex-snapshot

A tableaux-based theorem prover for a decidable subset of default logic

inferredcites →https://doi.org/10.1007/3-540-54659-6_91openalex-snapshot

Handling partially ordered defaults in TMS

inferredcites →https://doi.org/10.1007/3-540-54659-6_92openalex-snapshot

Computing extensions of default theories

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-3-642-86718-7openalex-snapshot

First-Order Logic

inferredcites →https://doi.org/10.1007/bf00247828openalex-snapshot

Tableaux and sequent calculus for minimal entailment

inferredcites →https://doi.org/10.1007/bfb0012860openalex-snapshot

Supposition-based logic for automated nonmonotonic reasoning

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(85)90040-2openalex-snapshot

Saturation, nonmonotonic reasoning and the closed-world assumption

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/b978-0-7204-2076-0.50006-4openalex-snapshot

ON THE FOUNDATIONS OF MATHEMATICS 1907

inferredcites →https://doi.org/10.1093/logcom/2.3.349openalex-snapshot

The Pure Logic of Necessitation

inferredcites →https://doi.org/10.1111/j.1467-8640.1988.tb00086.xopenalex-snapshot

Considerations on default logic: an alternative approach1

inferredcites →https://doi.org/10.1145/116825.116836openalex-snapshot

Autoepistemic logic

inferredcites →https://doi.org/10.25911/5d6fa29251193openalex-snapshot

Automated theorem-proving in non-classical logics

What points at this work

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

inferred← citeshttps://doi.org/10.1002/int.10108openalex-snapshot

A compositional reasoning system for executing nonmonotonic theories of reasoning

inferred← citeshttps://doi.org/10.1007/3-540-44652-4_51openalex-snapshot

Comparing a Pair-wise Compatibility Heuristic and Relaxed Stratification: Some Preliminary Results

inferred← citeshttps://doi.org/10.1007/3-540-45757-7_20openalex-snapshot

Interpolation Theorems for Nonmonotonic Reasoning Systems

inferred← citeshttps://doi.org/10.1007/3-540-45758-5_3openalex-snapshot

Analytic Tableaux and Database Repairs: Foundations

inferred← citeshttps://doi.org/10.1007/3-540-48747-6_4openalex-snapshot

Query-answering in Prioritized Default Logic

inferred← citeshttps://doi.org/10.1007/3-540-49545-2_16openalex-snapshot

An Approach to Query-Answering in Reiter’s Default Logic and the Underlying Existence of Extensions Problem

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-61532-6_40openalex-snapshot

Exten: A system for computing default logic extensions

inferred← citeshttps://doi.org/10.1007/3-540-61630-6_16openalex-snapshot

A system for computing constrained default logic extensions

inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_5openalex-snapshot

Proof Complexity of Propositional Default Logic

inferred← citeshttps://doi.org/10.1007/978-3-642-31485-8_1openalex-snapshot

Proof Complexity of Non-classical Logics

inferred← citeshttps://doi.org/10.1007/978-94-017-1739-7_4openalex-snapshot

The Family of Default 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/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.1007/bfb0035627openalex-snapshot

A compositional reasoning system for executing nonmonotonic theories of reasoning

inferred← citeshttps://doi.org/10.1007/bfb0057436openalex-snapshot

Extension calculus and query answering in prioritized default logic

inferred← citeshttps://doi.org/10.1007/s00153-011-0245-8openalex-snapshot

Proof complexity of propositional default logic

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/s0004-3702(00)00060-6openalex-snapshot

Alternative foundations for Reiter's default logic

inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00092-7openalex-snapshot

Prolog technology for default reasoning: proof theory and compilation techniques

inferred← citeshttps://doi.org/10.1016/s0020-0255(96)00269-1openalex-snapshot

Reasoning with incomplete and changing information: The CIN project

inferred← citeshttps://doi.org/10.1016/s0169-023x(97)00036-0openalex-snapshot

Default databases: Extending the approach of deductive databases using default logic

inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03006-4openalex-snapshot

Chapter 6 Nonmonotonic Reasoning

inferred← citeshttps://doi.org/10.1016/s1874-5857(07)80011-2openalex-snapshot

Default Logic

inferred← citeshttps://doi.org/10.1017/s0269888998002136openalex-snapshot

A tutorial on default reasoning

inferred← citeshttps://doi.org/10.1023/a:1004999920152openalex-snapshot

Is Default Logic a Reinvention of Inductive-Statistical Reasoning?

inferred← citeshttps://doi.org/10.1023/a:1026153912205openalex-snapshot

Database Repairs and Analytic Tableaux

inferred← citeshttps://doi.org/10.1080/11663081.1996.10510867openalex-snapshot

Analytic tableaux for default logics

inferred← citeshttps://doi.org/10.1109/tai.1997.632251openalex-snapshot

Stratification: the computational base of a system for default reasoning

inferred← citeshttps://doi.org/10.1145/344588.344602openalex-snapshot

A tutorial on default logics

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.3233/978-1-61499-419-0-1039openalex-snapshot

From Default and Autoepistemic Logics to Disjunctive Answer Set Programs via the Logic of GK

inferred← citeshttps://doi.org/10.48550/arxiv.1405.0809openalex-snapshot

Implementing Default and Autoepistemic Logics via the Logic of GK

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.