ASP for minimal entailment in a rational extension of SROEL

DOI10.1017/S1471068416000399zbMath1379.68294arXiv1608.02450OpenAlexW2963772318MaRDI QIDQ4593055

Daniele Theseider Dupré, Laura Giordano

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.02450

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Related Items (4)

A general framework for preferences in answer set programming ⋮ An ASP approach for reasoning in a concept-aware multipreferential lightweight DL ⋮ Rational closure for all description logics ⋮ Typicalities and probabilities of exceptions in nonmotonic description logics

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• A non-monotonic description logic for reasoning about typicality
• Semantic characterization of rational closure: from propositional logic to description logics
• Nonmonotonic reasoning, preferential models and cumulative logics
• What does a conditional knowledge base entail?
• Logic programming and knowledge representation---The A-Prolog perspective
• Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
• Another perspective on default reasoning
• Combining answer set programming with description logics for the semantic web
• Relevant Closure: A New Form of Defeasible Reasoning for Description Logics
• Preferential Description Logics
• Reconciling description logics and rules
• Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results
• The Complexity of Circumscription in DLs
• Rational Closure for Defeasible Description Logics
• Efficient Inferencing for OWL EL
• Description logics of minimal knowledge and negation as failure

This page was built for publication: ASP for minimal entailment in a rational extension of SROEL