Filters








11 Hits in 1.7 sec

A framework for a modular multi-concept lexicographic closure semantics [article]

Laura Giordano, Daniele Theseider Dupré
2020 arXiv   pre-print
We define a modular multi-concept extension of the lexicographic closure semantics for defeasible description logics with typicality.  ...  closure semantics.  ...  Acknowledgement: We thank the anonymous referees for their helpful comments and suggestions. This research is partially supported by INDAM-GNCS Project 2019.  ... 
arXiv:2009.00964v2 fatcat:zlhzj3epynavpear2yghztr7ne

Preface

Flavio Ferrarotti, Stefan Woltran
2019 Annals of Mathematics and Artificial Intelligence  
-In the paper Contextual Rational Closure for Defeasible ALC, Katarina Britz and Ivan Varzinczak tackle the problem of extending description logics to support defeasible reasoning.  ...  The paper provides a method for computing the (contextual) rational closure of a defeasible knowledge base in order to address the central problem of entailment.  ... 
doi:10.1007/s10472-019-09667-1 fatcat:olcrp5b5tjdypocn2emuuy7pgu

Theoretical Foundations of Defeasible Description Logics [article]

Katarina Britz, Giovanni Casini, Thomas Meyer, Kody Moodley, Uli Sattler, Ivan Varzinczak
2019 arXiv   pre-print
Indeed, we also analyse the problem of non-monotonic reasoning in DLs at the level of entailment and present an algorithm for the computation of rational closure of a defeasible ontology.  ...  classical DL ALC.  ...  Lexicographic closure for defeasible description logics. In [33] K. Britz and I. Varzinczak. Contextual rational closure for defeasible ALC.  ... 
arXiv:1904.07559v1 fatcat:icpvjvw6izctjd7uhirgyifxji

A conditional, a fuzzy and a probabilistic interpretation of self-organising maps [article]

Laura Giordano, Valentina Gliozzi, Daniele Theseider Dupré
2021 arXiv   pre-print
ranked and for weighted defeasible description logics.  ...  Starting from the fuzzy interpretation, we also provide a probabilistic account for this neural network model.  ...  Acknowledgement: We thank the anonymous referees for their helpful comments and suggestions that helped to improve the paper. This research has been partially supported by INDAM-GNCS Project 2020.  ... 
arXiv:2103.06854v2 fatcat:df5kf433xbbajbc7n7ndrerj6m

An ASP approach for reasoning in a concept-aware multipreferential lightweight DL

Laura Giordano, Daniele Theseider Dupré
2020 Theory and Practice of Logic Programming  
We exploit Answer Set Programming (in particular, asprin) to achieve defeasible reasoning under the multipreference approach for the lightweight description logic ξ$\mathcal L_ \bot ^ + $.  ...  of ranked TBoxes containing defeasible concept inclusions.  ...  starting from the rational closure ranking.  ... 
doi:10.1017/s1471068420000381 fatcat:o53oiwm5sfenle74de7frnat4m

On the Logical Properties of the Description Logic DL^N (Extended abstract)

Piero A. Bonatti, Luigi Sauro
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
DL^N is a recent nonmonotonic description logic, designed for satisfying independently proposed knowledge engineering requirements, and for removing some recurrent drawbacks of traditional nonmonotonic  ...  So a fair comparison of DL N with the rational closure of DLs shows that the two logics are very similar, under the expressiveness restrictions of the latter.  ...  DL N aims at removing some recurrent drawbacks of traditional nonmonotonic DLs 1 such as: (i) inheritance blocking, a drawback of preferential semantics and rational closure; (ii) undesired closed world  ... 
doi:10.24963/ijcai.2018/784 dblp:conf/ijcai/BonattiS18 fatcat:k5e5zxkjlvanroyxbpafyziliy

An ASP approach for reasoning in a concept-aware multipreferential lightweight DL [article]

Laura Giordano, Daniele Theseider Dupré
2020 arXiv   pre-print
We exploit Answer Set Programming (in particular, asprin) to achieve defeasible reasoning under the multipreference approach for the lightweight description logic EL+bot.  ...  TBoxes containing defeasible concept inclusions.  ...  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

Resolving conflicts in knowledge for ambient intelligence

Martin Homola, Theodore Patkos, Giorgos Flouris, Ján Šefránek, Alexander Šimko, Jozef Frtús, Dimitra Zografistou, Martin Baláž
2015 Knowledge engineering review (Print)  
Knowledge populated between the agents in such systems may be contextually dependent, ambiguous, and incomplete.  ...  As such, it is an interesting and challenging application area for many computer science fields and approaches.  ...  For the same reason, ontology debugging is mostly useful for contextual conflicts, but also for the other types of conflicts which are identifiable through a set of rationality constraints (validity rules  ... 
doi:10.1017/s0269888915000132 fatcat:dsa3goyft5bfxezoaz7iwuuauu

Ontologies and Data Management: A Brief Survey

Thomas Schneider, Mantas Šimkus
2020 Künstliche Intelligenz  
This survey gives an overview of research work on the use of ontologies for accessing incomplete and/or heterogeneous data.  ...  We would like to thank Anni-Yasmin Turhan, Magdalena Ortiz, and the anonymous reviewers for their useful remarks, which helped us to improve this survey.  ...  Bonatti PA (2019) Rational closure for all description log- ics. Artif Intell 274:197-223. https ://doi.org/10.1016/j.artin t.2019.04.001 70.  ... 
doi:10.1007/s13218-020-00686-3 pmid:32999532 pmcid:PMC7497697 fatcat:zeskjfjrpvcojjh6q3yjzhlyci

Expressive probabilistic description logics

Thomas Lukasiewicz
2008 Artificial Intelligence  
Lukasiewicz, P-SHOQ(D): A probabilistic extension of SHOQ(D) for probabilistic ontologies in the  ...  The work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web.  ...  I am very grateful to Rosalba Giugno for her contributions to the JELIA-2002 abstract of this paper.  ... 
doi:10.1016/j.artint.2007.10.017 fatcat:xhd5zpbx2bbflen2vsswy72w2i

Legal Ontologies for Public Procurement Management-Legal Ontologies for Public Procurement Management

Coordinatore Dottorato, Chiar Mo, Sartor
unpublished
Legal Ontologies for Public Procurement Management The thesis explores ways to formalize the legal knowledge concerning the public procurement domain by means of ontological patterns suitable, on one hand  ...  Such an investigation on the making up of conceptual models for the public procurement domain, in turn, inspires and motivates a reflection on the role of legal ontologies nowadays, as in the past, retracing  ...  In this case, it is necessary to use also Defeasible Logic, for representing this intricate legal matter.  ... 
fatcat:ewxdvo5pvra5fc45ohi5mgxszm