Defeasible RDFS via rational closure

DOI10.1016/J.INS.2022.11.165MaRDI QIDQ6490339zbMATH OpenFDO

Authors Giovanni Casini, Umberto Straccia

Publication date 23 April 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2022.11.165

zbMATH Keywords

defeasible reasoningnon-monotonic reasoningrational closureRDFS

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• A non-monotonic description logic for reasoning about typicality
• A note on the rational closure of knowledge bases with both positive and negative knowledge
• A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
• A reconstruction of multipreference closure
• Another perspective on default reasoning
• ASP for minimal entailment in a rational extension of SROEL
• Combining answer set programming with description logics for the semantic web
• Default reasoning from conditional knowledge bases: Complexity and tractable cases
• Defeasible inheritance-based description logics
• Expressive probabilistic description logics
• Extended RDF as a semantic foundation of rule markup languages
• Extended RDF: computability and complexity issues
• Foundations of semantic web databases
• scientific article; zbMATH DE number 43242 (Why is no real title available?)
• scientific article; zbMATH DE number 592370 (Why is no real title available?)
• scientific article; zbMATH DE number 2088364 (Why is no real title available?)
• Introduction to algorithms
• Large-scale parallel stratified defeasible reasoning
• Nonmonotonic reasoning, preferential models and cumulative logics
• Preferential reasoning in the perspective of Poole default logic
• Rational closure for all description logics
• Rational Closure for Defeasible Description Logics
• Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics
• Reconciling description logics and rules
• Relevant closure: a new form of defeasible reasoning for description logics
• Semantic characterization of rational closure: from propositional logic to description logics
• The Description Logic Handbook
• Typicalities and probabilities of exceptions in nonmotonic description logics
• Well-founded semantics for description logic programs in the semantic web
• What does a conditional knowledge base entail?
• When Maximizing Entropy gives the Rational Closure

Cited in

(1)

• How to tractably compute a productive repair for possibilistic partially ordered DL-Lite\(_{\mathcal{R}}\) ontologies?

This page was built for publication: Defeasible RDFS via rational closure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6490339)