Datalog and description logics: Expressive power

Author(s):  
Marco Cadoli ◽  
Luigi Palopoli ◽  
Maurizio Lenzerini
1999 ◽  
Vol 11 ◽  
pp. 199-240 ◽  
Author(s):  
D. Calvanese ◽  
M. Lenzerini ◽  
D. Nardi

The notion of class is ubiquitous in computer science and is central in many formalisms for the representation of structured knowledge used both in knowledge representation and in databases. In this paper we study the basic issues underlying such representation formalisms and single out both their common characteristics and their distinguishing features. Such investigation leads us to propose a unifying framework in which we are able to capture the fundamental aspects of several representation languages used in different contexts. The proposed formalism is expressed in the style of description logics, which have been introduced in knowledge representation as a means to provide a semantically well-founded basis for the structural aspects of knowledge representation systems. The description logic considered in this paper is a subset of first order logic with nice computational characteristics. It is quite expressive and features a novel combination of constructs that has not been studied before. The distinguishing constructs are number restrictions, which generalize existence and functional dependencies, inverse roles, which allow one to refer to the inverse of a relationship, and possibly cyclic assertions, which are necessary for capturing real world domains. We are able to show that it is precisely such combination of constructs that makes our logic powerful enough to model the essential set of features for defining class structures that are common to frame systems, object-oriented database languages, and semantic data models. As a consequence of the established correspondences, several significant extensions of each of the above formalisms become available. The high expressiveness of the logic we propose and the need for capturing the reasoning in different contexts forces us to distinguish between unrestricted and finite model reasoning. A notable feature of our proposal is that reasoning in both cases is decidable. We argue that, by virtue of the high expressive power and of the associated reasoning capabilities on both unrestricted and finite models, our logic provides a common core for class-based representation formalisms.


2011 ◽  
pp. 63-77
Author(s):  
Hailong Wang ◽  
Zongmin Ma ◽  
Li Yan ◽  
Jingwei Cheng

In the Semantic Web context, information would be retrieved, processed, shared, reused and aligned in the maximum automatic way possible. Our experience with such applications in the Semantic Web has shown that these are rarely a matter of true or false but rather procedures that require degrees of relatedness, similarity, or ranking. Apart from the wealth of applications that are inherently imprecise, information itself is many times imprecise or vague. In order to be able to represent and reason with such type of information in the Semantic Web, different general approaches for extending semantic web languages with the ability to represent imprecision and uncertainty has been explored. In this chapter, we focus our attention on fuzzy extension approaches which are based on fuzzy set theory. We review the existing proposals for extending the theoretical counterpart of the semantic web languages, description logics (DLs), and the languages themselves. The following statements will include the expressive power of the fuzzy DLs formalism and its syntax and semantic, knowledge base, the decidability of the tableaux algorithm and its computational complexity etc. Also the fuzzy extension to OWL is discussed in this chapter.


2021 ◽  
Author(s):  
Alessandro Artale ◽  
Andrea Mazzullo ◽  
Ana Ozaki ◽  
Frank Wolter

Definite descriptions are phrases of the form ‘the x such that φ’, used to refer to single entities in a context. They are often more meaningful to users than individual names alone, in particular when modelling or querying data over ontologies. We investigate free description logics with both individual names and definite descriptions as terms of the language, while also accounting for their possible lack of denotation. We focus on the extensions of ALC and, respectively, EL with nominals, the universal role, and definite descriptions. We show that standard reasoning in these extensions is not harder than in the original languages, and we characterise the expressive power of concepts relative to first-order formulas using a suitable notion of bisimulation. Moreover, we lay the foundations for automated support for definite descriptions generation by studying the complexity of deciding the existence of definite descriptions for an individual under an ontology. Finally, we provide a polynomial-time reduction of reasoning in other free description logic languages based on dual-domain semantics to the case of partial interpretations.


2019 ◽  
Vol 29 (8) ◽  
pp. 1289-1310
Author(s):  
Linh Anh Nguyen

Abstract Berman and Paterson proved that test-free propositional dynamic logic (PDL) is weaker than PDL. One would raise questions: does a similar result also hold for extensions of PDL? For example, is test-free converse-PDL (CPDL) weaker than CPDL? In what circumstances the test operator can be eliminated without reducing the expressive power of a PDL-based logical formalism? These problems have not yet been studied. As the description logics $\mathcal{ALC}_{trans}$ and $\mathcal{ALC}_{reg}$ are, respectively, variants of test-free PDL and PDL, there is a concept of $\mathcal{ALC}_{reg}$ that is not equivalent to any concept of $\mathcal{ALC}_{trans}$. Generalizing this, we prove that there is a concept of $\mathcal{ALC}_{reg}$ that is not equivalent to any concept of the logic that extends $\mathcal{ALC}_{trans}$ with inverse roles, nominals, qualified number restrictions, the universal role and local reflexivity of roles. We also provide some results for the case with RBoxes and TBoxes. One of them states that tests can be eliminated from TBoxes of the deterministic Horn fragment of $\mathcal{ALC}_{reg}$.


2018 ◽  
Vol 83 (04) ◽  
pp. 1307-1344
Author(s):  
VINCE BÁRÁNY ◽  
MICHAEL BENEDIKT ◽  
BALDER TEN CATE

AbstractThe Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive existential formulas, can express the first-order translations of basic modal logic and of many description logics, along with many sentences that arise in databases. It has been shown that the syntax of GNFO is restrictive enough so that computational problems such as validity and satisfiability are still decidable. This suggests that, in spite of its expressive power, GNFO formulas are amenable to novel optimizations. In this article we study the model theory of GNFO formulas. Our results include effective preservation theorems for GNFO, effective Craig Interpolation and Beth Definability results, and the ability to express the certain answers of queries with respect to a large class of GNFO sentences within very restricted logics.


Author(s):  
Paul Wild ◽  
Lutz Schröder

Modal description logics feature modalities that capture dependence of knowledge on parameters such as time, place, or the information state of agents. E.g., the logic S5-ALC combines the standard description logic ALC with an S5-modality that can be understood as an epistemic operator or as representing (undirected) change. This logic embeds into a corresponding modal first-order logic S5-FOL. We prove a modal characterization theorem for this embedding, in analogy to results by van Benthem and Rosen relating ALC to standard first-order logic: We show that S5-ALC with only local roles is, both over finite and over unrestricted models, precisely the bisimulation-invariant fragment of S5-FOL, thus giving an exact description of the expressive power of S5-ALC with only local roles.


Author(s):  
Hailong Wang

In the Semantic Web context, information would be retrieved, processed, shared, reused and aligned in the maximum automatic way possible. Our experience with such applications in the Semantic Web has shown that these are rarely a matter of true or false but rather procedures that require degrees of relatedness, similarity, or ranking. Apart from the wealth of applications that are inherently imprecise, information itself is many times imprecise or vague. In order to be able to represent and reason with such type of information in the Semantic Web, different general approaches for extending semantic web languages with the ability to represent imprecision and uncertainty has been explored. In this chapter, we focus our attention on fuzzy extension approaches which are based on fuzzy set theory. We review the existing proposals for extending the theoretical counterpart of the semantic web languages, description logics (DLs), and the languages themselves. The following statements will include the expressive power of the fuzzy DLs formalism and its syntax and semantic, knowledge base, the decidability of the tableaux algorithm and its computational complexity etc. Also the fuzzy extension to OWL is discussed in this chapter.


2011 ◽  
Vol 11 (4-5) ◽  
pp. 801-819 ◽  
Author(s):  
MARTIN SLOTA ◽  
JOÃO LEITE ◽  
TERRANCE SWIFT

AbstractOver the years, nonmonotonic rules have proven to be a very expressive and useful knowledge representation paradigm. They have recently been used to complement the expressive power of Description Logics (DLs), leading to the study of integrative formal frameworks, generally referred to ashybrid knowledge bases, where both DL axioms and rules can be used to represent knowledge. The need to use these hybrid knowledge bases in dynamic domains has called for the development of update operators, which, given the substantially different way DLs and rules are usually updated, has turned out to be an extremely difficult task. In Slota and Leite (2010b Towards Closed World Reasoning in Dynamic Open Worlds.Theory and Practice of Logic Programming, 26th Int'l. Conference on Logic Programming (ICLP'10) Special Issue10(4–6) (July), 547–564.), a first step towards addressing this problem was taken, and an update operator for hybrid knowledge bases was proposed. Despite its significance—not only for being the first update operator for hybrid knowledge bases in the literature, but also because it has some applications—this operator was defined for a restricted class of problems where only the ABox was allowed to change, which considerably diminished its applicability. Many applications that use hybrid knowledge bases in dynamic scenarios require both DL axioms and rules to be updated. In this paper, motivated by real world applications, we introduce an update operator for a large class of hybrid knowledge bases where both the DL component as well as the rule component are allowed to dynamically change. We introduce splitting sequences and splitting theorem for hybrid knowledge bases, use them to define a modular update semantics, investigate its basic properties, and illustrate its use on a realistic example about cargo imports.


Author(s):  
Volker Haarslev ◽  
Hsueh-Ieng Pai ◽  
Nematollaah Shiri

Since the introduction of the Semantic Web vision (Berners- Lee, Hendler, & Lassila, 2001), attempts have been made for making Web resources more machine interpretable by giving them a well-defined meaning through semantic markups. One way to encode such semantic markups is to use ontologies. An ontology is “an explicit specification of a conceptualization” (Gruber, 1993, p. 199). Informally, an ontology consists of a set of terms in a domain, relationships between the terms, and a set of constraints on the way in which those terms can be combined. By explicitly defining the relationships and constraints among the terms, the semantics of the terms can be better defined and understood. Over the last few years, a number of ontology languages have been developed, most of which use Description Logics (DLs) (Baader, McGuinness, Nardi, & Schneider, 2003) as the foundation. The family of DLs is a subset of first-order logic (FOL) and is considered to be attractive as it keeps a good compromise between expressive power and computational tractability. Uncertainty is a form of deficiency or imperfection in the information/data, where the truth of information is not established definitely. Uncertainty modeling and reasoning have been challenging issues for over two decades in many disciplines, such as database and artificial intelligence. Most of the information in the real world is uncertain or imprecise, for example, classifications of genes in bioinformatics, schema matching in information integration, finding best matches in a Web search, and so forth. Therefore, uncertainty management is essential for the success of many such applications and in particular DLs and the Semantic Web. Despite its popularity, it has been realized that classical DLs are inadequate to model uncertainty. For example, in the medical domain, one might want to express that: “It is very likely that an obese person would have heart disease,” where “obese” is a vague concept that may vary across regions and “likely” shows the uncertain nature of this information. Such an expression cannot be expressed using classical DLs. The importance of incorporating uncertainty in DLs has been recognized by the knowledge representation community: “modeling primitives such as … fuzzy/probabilistic definitions” could be the next step for extension (Horrocks et al., 2000, p. 3). For this, a number of frameworks have been proposed to incorporate uncertainty in DLs. This paper provides a survey of these proposals. The rest of this paper is organized as follows. We first provide the background on the classical DL framework. We then study representative extensions of DLs with uncertainty. This follows by some possible research directions for incorporating uncertainty in the Semantic Web. We conclude with a summary and some remarks.


Sign in / Sign up

Export Citation Format

Share Document