On the public citation graph

Towards automatic autoepistemic reasoning

https://doi.org/10.1007/bfb0018457
0 signed · 32 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/978-3-642-79235-9openalex-snapshot
Structural Complexity I
inferredcites →https://doi.org/10.1007/bfb0012865openalex-snapshot
Decision procedure for autoepistemic logic
inferredcites →https://doi.org/10.1016/0004-3702(80)90012-0openalex-snapshot
Non-monotonic logic I
inferredcites →https://doi.org/10.1016/0004-3702(85)90042-6openalex-snapshot
Semantical considerations on nonmonotonic logic
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(90)90056-6openalex-snapshot
All I know: A study in autoepistemic logic
inferredcites →https://doi.org/10.1016/0004-3702(90)90086-fopenalex-snapshot
A rational reconstruction of nonmonotonic truth maintenance systems
inferredcites →https://doi.org/10.1145/116825.116836openalex-snapshot
Autoepistemic logic

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-58107-3_16openalex-snapshot
On the impact of stratification on the complexity of nonmonotonic reasoning
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_10openalex-snapshot
Separating disbeliefs from beliefs in autoepistemic reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_42openalex-snapshot
Only Knowing with Confidence Levels: Reductions and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_21openalex-snapshot
General Default Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_33openalex-snapshot
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-0689-6_20openalex-snapshot
Remarks on a Carnapian Extension of S5
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_8openalex-snapshot
Tableaux for Nonmonotonic Logics
inferred← citeshttps://doi.org/10.1007/bf00883929openalex-snapshot
A decision method for nonmonotonic reasoning based on autoepistemic reasoning
inferred← citeshttps://doi.org/10.1007/bf02228999openalex-snapshot
A survey of non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/bfb0021961openalex-snapshot
From Carnap's modal logic to autoepistemic logic
inferred← citeshttps://doi.org/10.1007/bfb0021976openalex-snapshot
Prioritized autoepistemic logic
inferred← citeshttps://doi.org/10.1007/s00153-015-0435-xopenalex-snapshot
On the parameterized complexity of non-monotonic logics
inferred← citeshttps://doi.org/10.1007/s10472-009-9161-6openalex-snapshot
General 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(02)00245-xopenalex-snapshot
On the computational complexity of assumption-based argumentation for default reasoning
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00383-8openalex-snapshot
Propositional default logics made easier: computational complexity of model checking
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03006-4openalex-snapshot
Chapter 6 Nonmonotonic Reasoning
inferred← citeshttps://doi.org/10.1023/a:1018915113814openalex-snapshot
On the intertranslatability of non‐monotonic logics
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366883openalex-snapshot
NP trees and Carnap's modal logic
inferred← citeshttps://doi.org/10.1145/201019.201031openalex-snapshot
NP trees and Carnap's modal logic
inferred← citeshttps://doi.org/10.1145/210332.210334openalex-snapshot
Translating default logic into standard autoepistemic logic
inferred← citeshttps://doi.org/10.1145/2159531.2159539openalex-snapshot
The Complexity of Reasoning for Fragments of Autoepistemic Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1108.3281openalex-snapshot
Origins of Answer-Set Programming - Some Background And Two Personal Accounts
inferred← citeshttps://doi.org/10.48550/arxiv.1110.0623openalex-snapshot
On the Parameterized Complexity of Default Logic and Autoepistemic 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.