On the public citation graph
Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
0 signed · 97 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-54659-6_91openalex-snapshot
Handling partially ordered defaults in TMS
inferredcites →https://doi.org/10.1007/3-540-56804-2_13openalex-snapshot
Combining classification and nonmonotonic inheritance reasoning: A first step
inferredcites →https://doi.org/10.1007/978-3-662-05689-9openalex-snapshot
An Introduction to Default Logic
inferredcites →https://doi.org/10.1007/bf00883932openalex-snapshot
Embedding defaults into terminological knowledge representation formalisms
inferredcites →https://doi.org/10.1007/bfb0021977openalex-snapshot
Adding priorities and specificity to default logic
inferredcites →https://doi.org/10.1007/bfb0030392openalex-snapshot
Deduction with supernormal defaults
inferredcites →https://doi.org/10.1016/0004-3702(80)90014-4openalex-snapshot
A logic for default reasoning
inferredcites →https://doi.org/10.1016/b978-1-4832-0771-1.50022-9openalex-snapshot
LIVING WITH CLASSIC
inferredcites →https://doi.org/10.22028/d291-24868openalex-snapshot
How to prefer more specific defaults in terminological default 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/1-4020-3092-4_1openalex-snapshot
Knowledge Representation with Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_11openalex-snapshot
Alternating Fixpoint Theory for Logic Programs with Priority
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_2openalex-snapshot
Logic-Based Knowledge Representation
inferred← citeshttps://doi.org/10.1007/3-540-48384-5_13openalex-snapshot
Terminological Default Reasoning about Spatial Information: A First Step
inferred← citeshttps://doi.org/10.1007/978-3-030-29765-7_18openalex-snapshot
Reasoning About Exceptions in Ontologies: An Approximation of the Multipreference Semantics
inferred← citeshttps://doi.org/10.1007/978-3-031-35254-6_18openalex-snapshot
Ergo: A Quest for Declarativity in Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-47546-7_6openalex-snapshot
A Defeasible Description Logic for Abduction
inferred← citeshttps://doi.org/10.1007/978-3-319-03524-6_6openalex-snapshot
PreDeLo 1.0: A Theorem Prover for Preferential Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-319-24309-2_13openalex-snapshot
A Multi-engine Theorem Prover for a Description Logic of Typicality
inferred← citeshttps://doi.org/10.1007/978-3-319-25007-6_21openalex-snapshot
Optimizing the Computation of Overriding
inferred← citeshttps://doi.org/10.1007/978-3-319-25252-0_27openalex-snapshot
Encoding a Preferential Extension of the Description Logic $$\mathcal {SROIQ}$$ into $$\mathcal {SROIQ}$$
inferred← citeshttps://doi.org/10.1007/978-3-319-49130-1_29openalex-snapshot
Reasoning about Multiple Aspects in Rational Closure for DLs
inferred← citeshttps://doi.org/10.1007/978-3-319-49130-1_31openalex-snapshot
Reasoning About Surprising Scenarios in Description Logics of Typicality
inferred← citeshttps://doi.org/10.1007/978-3-319-61581-3_37openalex-snapshot
Reasoning in Description Logics with Typicalities and Probabilities of Exceptions
inferred← citeshttps://doi.org/10.1007/978-3-540-30504-0_8openalex-snapshot
Defeasible Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-39451-8_8openalex-snapshot
Optimality Theory through Default Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_20openalex-snapshot
Preferential Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-87803-2_17openalex-snapshot
Reasoning about Typicality in Preferential Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_29openalex-snapshot
Default Logics with Preference Order: Principles and Characterisations
inferred← citeshttps://doi.org/10.1007/978-3-642-02846-5_35openalex-snapshot
Logic Programming with Defaults and Argumentation Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_38openalex-snapshot
Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results
inferred← citeshttps://doi.org/10.1007/978-3-642-10291-2_7openalex-snapshot
Reasoning about Typicality with Low Complexity Description Logics: The Logic $\mathcal{EL}^{+^\bot}{\bf T}$
inferred← citeshttps://doi.org/10.1007/978-3-642-15675-5_9openalex-snapshot
Rational Closure for Defeasible Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-17746-0_5openalex-snapshot
$\mathcal{EL}$ with Default Attributes and Overriding
inferred← citeshttps://doi.org/10.1007/978-3-642-22119-4_15openalex-snapshot
A Tableau Calculus for a Nonmonotonic Extension of $\mathcal{EL}^\bot$
inferred← citeshttps://doi.org/10.1007/978-3-642-23954-0_17openalex-snapshot
A Tableau Calculus for a Nonmonotonic Extension of the Description Logic $\mbox{\em DL-Lite}_{\mathit{core}}$
inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_3openalex-snapshot
Prioritizing Default Logic
inferred← citeshttps://doi.org/10.1007/bfb0023803openalex-snapshot
Nonmonotonic reasoning by monotonic inferences with priority constraints
inferred← citeshttps://doi.org/10.1007/bfb0054795openalex-snapshot
Reasoning with prioritized defaults
inferred← citeshttps://doi.org/10.1007/s10462-007-9044-3openalex-snapshot
A revision-based approach to handling inconsistency in description logics
inferred← citeshttps://doi.org/10.1007/s10472-015-9475-5openalex-snapshot
Preferences in artificial intelligence
inferred← citeshttps://doi.org/10.1007/s10472-015-9494-2openalex-snapshot
Prioritized assertional-based removed sets revision of DL-Lite belief bases
inferred← citeshttps://doi.org/10.1007/s10472-021-09770-2openalex-snapshot
Query answering in circumscribed OWL2 profiles
inferred← citeshttps://doi.org/10.1007/s11023-012-9300-4openalex-snapshot
Preferential Semantics for Plausible Subsumption in Possibility Theory
inferred← citeshttps://doi.org/10.1007/s11229-025-04950-7openalex-snapshot
Believing in default rules: inclusive default reasoning
inferred← citeshttps://doi.org/10.1016/j.artint.2007.10.017openalex-snapshot
Expressive probabilistic description logics
inferred← citeshttps://doi.org/10.1016/j.artint.2010.09.001openalex-snapshot
Defeasible inheritance with doubt index and its axiomatic characterization
inferred← citeshttps://doi.org/10.1016/j.artint.2012.10.004openalex-snapshot
A non-monotonic Description Logic for reasoning about typicality
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.010openalex-snapshot
A new semantics for overriding in description logics
inferred← citeshttps://doi.org/10.1016/j.artint.2015.05.001openalex-snapshot
Semantic characterization of rational closure: From propositional logic to description logics
inferred← citeshttps://doi.org/10.1016/j.artint.2017.04.001openalex-snapshot
On the logical properties of the nonmonotonic description logic DLN
inferred← citeshttps://doi.org/10.1016/j.artint.2019.04.001openalex-snapshot
Rational closure for all description logics
inferred← citeshttps://doi.org/10.1016/j.ijar.2019.02.003openalex-snapshot
Typicalities and probabilities of exceptions in nonmotonic Description Logics
inferred← citeshttps://doi.org/10.1016/j.ins.2018.09.037openalex-snapshot
A polynomial Time Subsumption Algorithm for Nominal Safe ELO⊥ under Rational Closure
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00054-0openalex-snapshot
Prioritized logic programming and its application to commonsense reasoning
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00097-6openalex-snapshot
Lexicographic priorities in default logic
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03006-4openalex-snapshot
Chapter 6 Nonmonotonic Reasoning
inferred← citeshttps://doi.org/10.1017/s1471068402001576openalex-snapshot
Using methods of declarative logic programming for intelligent information agents
inferred← citeshttps://doi.org/10.1017/s1471068403001753openalex-snapshot
Computing preferred answer sets by meta-interpretation in Answer Set Programming
inferred← citeshttps://doi.org/10.1017/s1471068416000399openalex-snapshot
ASP for minimal entailment in a rational extension of SROEL
inferred← citeshttps://doi.org/10.1080/0952813x.2019.1672799openalex-snapshot
A description logic framework for commonsense conceptual combination integrating typicality, probabilities and cognitive heuristics
inferred← citeshttps://doi.org/10.1093/jigpal/jzae086openalex-snapshot
Two semantic interpretations of probabilities in description logics of typicality
inferred← citeshttps://doi.org/10.1093/logcom/exab082openalex-snapshot
A conditional, a fuzzy and a probabilistic interpretation of self-organizing maps
inferred← citeshttps://doi.org/10.1093/logcom/exae038openalex-snapshot
Complexity and scalability of defeasible reasoning in many-valued weighted knowledge bases with typicality
inferred← citeshttps://doi.org/10.1109/69.971190openalex-snapshot
Nonmonotonic reasoning as prioritized argumentation
inferred← citeshttps://doi.org/10.1109/bracis.2014.40openalex-snapshot
An ALC Description Default Logic with Exceptions-First
inferred← citeshttps://doi.org/10.1109/isiu.1999.824868openalex-snapshot
Towards computer vision with description logics: some recent progress
inferred← citeshttps://doi.org/10.1111/papq.12044openalex-snapshot
Deontic Modals: Why Abandon the Classical Semantics?
inferred← citeshttps://doi.org/10.11606/d.45.2014.tde-20230727-113318openalex-snapshot
Typicality in description logics
inferred← citeshttps://doi.org/10.11606/t.45.2020.tde-19032020-043422openalex-snapshot
Modularity in belief change of description logic bases
inferred← citeshttps://doi.org/10.1613/jair.2763openalex-snapshot
The Complexity of Circumscription in DLs
inferred← citeshttps://doi.org/10.1613/jair.554openalex-snapshot
Complexity of Prioritized Default Logics
inferred← citeshttps://doi.org/10.24963/ijcai.2017/705openalex-snapshot
A New Semantics for Overriding in Description Logics (Extended Abstract)
inferred← citeshttps://doi.org/10.24963/ijcai.2023/353openalex-snapshot
Description Logics with Pointwise Circumscription
inferred← citeshttps://doi.org/10.26686/ajl.v21i2.8072openalex-snapshot
Modeling Deep Disagreement in Default Logic
inferred← citeshttps://doi.org/10.29007/6ph5openalex-snapshot
Query Answering With Non-Monotonic Rules: A Case Study of Archaeology Qualitative Spatial Reasoning
inferred← citeshttps://doi.org/10.31237/osf.io/dw5p2openalex-snapshot
Practical Reasoning for Defeasible Description Logics
inferred← citeshttps://doi.org/10.3233/fi-2009-182openalex-snapshot
ALC + T: a Preferential Extension of Description Logics
inferred← citeshttps://doi.org/10.3233/fi-2018-1659openalex-snapshot
Towards a Rational Closure for Expressive Description Logics: the Case of 𝒮𝒽𝒾𝓆
inferred← citeshttps://doi.org/10.3233/ia-170105openalex-snapshot
Reasoning about plausible scenarios in Description Logics of typicality
inferred← citeshttps://doi.org/10.3233/ssw200041openalex-snapshot
Reasoning About Typicality and Probabilities in Preferential Description Logics
inferred← citeshttps://doi.org/10.3233/ssw200043openalex-snapshot
Defeasible Reasoning in Description Logics: An Overview on DLN
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2011.162openalex-snapshot
Transaction Logic with Defaults and Argumentation Theories
inferred← citeshttps://doi.org/10.48550/arxiv.1305.1060openalex-snapshot
On Rational Closure in Description Logics of Typicality
inferred← citeshttps://doi.org/10.48550/arxiv.1401.3901openalex-snapshot
Defeasible Inclusions in Low-Complexity DLs
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6566openalex-snapshot
On the Non-Monotonic Description Logic $\mathcal{ALC}$+T$_{\mathsf{min}}$
inferred← citeshttps://doi.org/10.48550/arxiv.1507.04630openalex-snapshot
Optimizing the computation of overriding
inferred← citeshttps://doi.org/10.48550/arxiv.1603.08714openalex-snapshot
Properties of ABA+ for Non-Monotonic Reasoning
inferred← citeshttps://doi.org/10.48550/arxiv.1604.00301openalex-snapshot
A strengthening of rational closure in DLs: reasoning about multiple aspects
inferred← citeshttps://doi.org/10.48550/arxiv.1801.07161openalex-snapshot
Reasoning about multiple aspects in DLs: Semantics and Closure Construction
inferred← citeshttps://doi.org/10.48550/arxiv.2003.13159openalex-snapshot
Extending Automated Deduction for Commonsense Reasoning
inferred← citeshttps://doi.org/10.48550/arxiv.2009.04978openalex-snapshot
Defeasible reasoning in Description Logics: an overview on DL^N
inferred← citeshttps://doi.org/10.48550/arxiv.2103.06854openalex-snapshot
A conditional, a fuzzy and a probabilistic interpretation of self-organising maps
inferred← citeshttps://doi.org/10.5555/1641503.1641520openalex-snapshot
The complexity of circumscription in description logic
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-134openalex-snapshot
On the complexity of EL with defeasible inclusions
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-155openalex-snapshot
Reasoning about typicality in low complexity DLs: the logics EL ⊥ T min and DL-Lite c T min
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.