A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In this paper we exploit Answer Set Programming (ASP) for reasoning in a rational extension SROEL-R-T of the low complexity description logic SROEL, which underlies the OWL EL ontology language. ... Relying on a Small Model result, where models correspond to answer sets of a suitable ASP encoding, we exploit Answer Set Preferences (and, in particular, the asprin framework) for reasoning under minimal ... A rational extension of SROEL(⊓, ×) In this section we extend the notion of concept in SROEL(⊓, ×), defined by Krötzsch (2010a) , adding typicality concepts (we refer to (Krötzsch 2010a ) for a detailed ...arXiv:1608.02450v1 fatcat:iku6wlfplzedhe3bruunvyxwli
Relying on a Small Model result, where models correspond to answer sets of a suitable ASP encoding, we exploit Answer Set Preferences (and, in particular, theasprinframework) for reasoning under minimal ... It has been proven that instance checking under rational entailment has a polynomial complexity. To strengthen rational entailment, in this paper we consider a minimal model semantics. ... We call the logic SROEL(⊓, ×) R T and define notions of rational and minimal entailment for it. ...doi:10.1017/s1471068416000399 fatcat:tf7as3upcrfohn44rbufhxuksy
AbstractIn this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection ... The construction of the concept-aware multipreference semantics is related to Brewka's framework for qualitative preferences. ... Conclusions and related work In this paper we have developed an ASP approach for defeasible inference in a conceptwise multipreference extension of EL ⊥ . ...doi:10.1017/s1471068420000381 fatcat:o53oiwm5sfenle74de7frnat4m
In this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection of ranked ... The paper is under consideration for acceptance in TPLP. ... Acknowledgement: We thank the anonymous referees for their helpful comments and suggestions. This research is partially supported by INDAM-GNCS Project 2019. ...arXiv:2006.04387v2 fatcat:5filqvcrpfhn5djcrlkernigki
It seems fitting to hold a significant, power of two, ICLP in New York because the city has a long and distinguished association with logic programming: XSB was developed at Stony Brook, as was HiLog before ... The main track of the Thirty Second International Conference on Logic Programming (ICLP) took place in New York City, USA, from the 18thto the 21stOctober 2016. ... , Editor-in-Chief of Theory and Practice of Logic Programming. ...doi:10.1017/s1471068416000491 fatcat:qzindp2mnbbk3p54666cwmebee
We show here how to model a rational form of entailment for expressive DLs, such as SROIQ, providing a novel reasoning procedure that compiles a non-monotone DL knowledge base into a description logic ... Lehmann and Magidor's rational closure is acknowledged as a landmark in the field of non-monotonic logics and it has also been re-formulated in the context of Description Logics (DLs). ... We are not aware of any approach that relies on Dl-programs, but [16, 17] propose an ASP-based decision procedure for the DL SROEL, relying on a Datalog encoding of the DL knowledge base. ...arXiv:2107.06075v1 fatcat:opsep2cpwrabfmonbvlsw3zije