26,779 research outputs found
Reasoning about Typicality and Probabilities in Preferential Description Logics
In this work we describe preferential Description Logics of typicality, a
nonmonotonic extension of standard Description Logics by means of a typicality
operator T allowing to extend a knowledge base with inclusions of the form T(C)
v D, whose intuitive meaning is that normally/typically Cs are also Ds. This
extension is based on a minimal model semantics corresponding to a notion of
rational closure, built upon preferential models. We recall the basic concepts
underlying preferential Description Logics. We also present two extensions of
the preferential semantics: on the one hand, we consider probabilistic
extensions, based on a distributed semantics that is suitable for tackling the
problem of commonsense concept combination, on the other hand, we consider
other strengthening of the rational closure semantics and construction to avoid
the so-called blocking of property inheritance problem.Comment: 17 pages. arXiv admin note: text overlap with arXiv:1811.0236
An Extension of Description Logic AL
The research in the domain of knowledge representation and reasoning has always concentrated on the methods that give a good description in the domain where they are able to be used to construct intelligent applications. Description Logics are a family of languages of knowledge representation which can be used to represent knowledge of a field of applications by clear, formal and structured means. In this paper, we give an overview of what are Description Logics and their actual applications in different fields and a brief idea of extensions of Description Logic AL, as we also introduce two operators, the operator less and operator more, which allow us to obtain a new extension of the Description Logic AL
Keys, Nominals, and Concrete Domains
Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to 'concrete' domains such as numbers and strings with built-in predicates such as <, +, and prefix-of. These hybrid DLs have turned out to be quite useful for reasoning about conceptual models of information systems, and as the basis for expressive ontology languages. We propose to further extend such DLs with key constraints that allow the expression of statements like 'US citizens are uniquely identified by their social security number'. Based on this idea, we introduce a number of natural description logics and perform a detailed analysis of their decidability and computational complexity. It turns out that naive extensions with key constraints easily lead to undecidability, whereas more careful extensions yield NEXPTIME-complete DLs for a variety of useful concrete domains
Tailoring temporal description logics for reasoning over temporal conceptual models
Temporal data models have been used to describe how data can evolve in the context of temporal databases. Both the Extended Entity-Relationship (EER) model and the Unified Modelling Language (UML) have been temporally extended to design temporal databases. To automatically check quality properties of conceptual schemas various encoding to Description Logics (DLs) have been proposed in the literature. On the other hand, reasoning on temporally extended DLs turn out to be too complex for effective reasoning ranging from 2ExpTime up to undecidable languages. We propose here to temporalize the ‘light-weight’ DL-Lite logics obtaining nice computational results while still being able to represent various constraints of temporal conceptual models. In particular, we consider temporal extensions of DL-Lite^N_bool, which was shown to be adequate for capturing non-temporal conceptual models without relationship inclusion, and its fragment DL-Lite^N_core with most primitive concept inclusions, which are nevertheless enough to represent almost all types of atemporal constraints (apart from
covering)
Probabilistic description logics for subjective uncertainty
We propose a family of probabilistic description logics (DLs) that are derived in a principled way from Halpern's probabilistic first-order logic. The resulting probabilistic DLs have a two-dimensional semantics similar to temporal DLs and are well-suited for representing subjective probabilities. We carry out a detailed study of reasoning in the new family of logics, concentrating on probabilistic extensions of the DLs ALC and EL, and showing that the complexity ranges from PTime via ExpTime and 2ExpTime to undecidable
Action, Time and Space in Description Logics
Description Logics (DLs) are a family of logic-based knowledge representation (KR) formalisms designed to represent and reason about static conceptual knowledge in a semantically well-understood way. On the other hand, standard action formalisms are KR formalisms based on classical logic designed to model and reason about dynamic systems. The largest part of the present work is dedicated to integrating DLs with action formalisms, with the main goal of obtaining decidable action formalisms with an expressiveness significantly beyond propositional. To this end, we offer DL-tailored solutions to the frame and ramification problem. One of the main technical results is that standard reasoning problems about actions (executability and projection), as well as the plan existence problem are decidable if one restricts the logic for describing action pre- and post-conditions and the state of the world to decidable Description Logics. A smaller part of the work is related to decidable extensions of Description Logics with concrete datatypes, most importantly with those allowing to refer to the notions of space and time
Uniform and Modular Sequent Systems for Description Logics
We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be obtained for extensions of description logics with special formulae that we call "role relational axioms." All sequent systems are sound, complete, and possess favorable properties such as height-preserving admissibility of common structural rules and height-preserving invertibility of rules
- …