Results 1  10
of
43
Description Logics as Ontology Languages for the Semantic Web
 Festschrift in honor of Jörg Siekmann, Lecture Notes in Artificial Intelligence
, 2003
"... The vision of a Semantic Web has recently drawn considerable attention, both from academia and industry. Description logics are often named as one of the tools that can support the Semantic Web and thus help to make this vision reality. ..."
Abstract

Cited by 126 (5 self)
 Add to MetaCart
The vision of a Semantic Web has recently drawn considerable attention, both from academia and industry. Description logics are often named as one of the tools that can support the Semantic Web and thus help to make this vision reality.
Integrity Constraints for XML
, 1999
"... this paper, we extend XML DTDs with several classes of integrity constraints and investigate the complexity of reasoning about these constraints. The constraints range over keys, foreign keys, inverse constraints as well as ID constraints for capturing the semantics of object identities. They imp ..."
Abstract

Cited by 83 (12 self)
 Add to MetaCart
this paper, we extend XML DTDs with several classes of integrity constraints and investigate the complexity of reasoning about these constraints. The constraints range over keys, foreign keys, inverse constraints as well as ID constraints for capturing the semantics of object identities. They improve semantic specifications and provide a better reference mechanism for native XML applications. They are also useful in information exchange and data integration for preserving the semantics of data originating in relational and objectoriented databases. We establish complexity and axiomatization results for the (finite) implication problems associated with these constraints. In addition, we study implication of more general constraints, such as functional, inclusion and inverse constraints defined in terms of navigation paths
Path Constraints on Semistructured and Structured Data
, 1998
"... We present a class of path constraints of interest in connection with both structured and semistructured databases, and investigate their associated implication problems. These path constraints are capable of expressing natural integrity constraints that are not only a fundamental part of the semant ..."
Abstract

Cited by 63 (18 self)
 Add to MetaCart
We present a class of path constraints of interest in connection with both structured and semistructured databases, and investigate their associated implication problems. These path constraints are capable of expressing natural integrity constraints that are not only a fundamental part of the semantics of the data, but are also important in query optimization. We show that in semistructured databases, despite the simple syntax of the constraints, their associated implication problem is r.e. complete and finite implication problem is cor.e. complete. However, we establish the decidability of the implication problems for several fragments of the path constraint language, and demonstrate that these fragments suffice to express important semantic information such as inverse relationships and local database constraints commonly found in objectoriented databases. We also show that in the presence of types, the analysis of path constraint implication becomes more delicate. We demonst...
TwoVariable Logic with Counting is Decidable
, 1996
"... We prove that the satisfiability problem for C² is decidable. C² is firstorder logic with only two variables in the presence of arbitrary counting quantifiers 9 ?m , m ? 1. It considerably extends L², plain firstorder with only two variables, which is known to be decidable by a result of Mort ..."
Abstract

Cited by 59 (3 self)
 Add to MetaCart
We prove that the satisfiability problem for C² is decidable. C² is firstorder logic with only two variables in the presence of arbitrary counting quantifiers 9 ?m , m ? 1. It considerably extends L², plain firstorder with only two variables, which is known to be decidable by a result of Mortimer. Unlike L², C² does not have the finite model property. As C² extends L² by expressive means for counting, significant applications arise from the fact that C² embeds corresponding counting extensions of modal logics.
Xpath leashed
 IN ACM COMPUTING SURVEYS
, 2007
"... This survey gives an overview of formal results on the XML query language XPath. We identify several important fragments of XPath, focusing on subsets of XPath 1.0. We then give results on the expressiveness of XPath and its fragments compared to other formalisms for querying trees, algorithms and c ..."
Abstract

Cited by 36 (3 self)
 Add to MetaCart
This survey gives an overview of formal results on the XML query language XPath. We identify several important fragments of XPath, focusing on subsets of XPath 1.0. We then give results on the expressiveness of XPath and its fragments compared to other formalisms for querying trees, algorithms and complexity bounds for evaluation of XPath queries, and static analysis of XPath queries.
The complexity of reasoning with boolean modal logics
 LTCSReport 0002, LuFG Theoretical Computer Science, RWTH
, 2001
"... 1 Motivation Since Modal Logics are an extension of Propositional Logic, they provide Boolean operators for constructing complex formulae. However, most Modal Logics do not admit Boolean operators for constructing complex modal parameters to be used in the box and diamond operators. This asymmetry i ..."
Abstract

Cited by 35 (5 self)
 Add to MetaCart
1 Motivation Since Modal Logics are an extension of Propositional Logic, they provide Boolean operators for constructing complex formulae. However, most Modal Logics do not admit Boolean operators for constructing complex modal parameters to be used in the box and diamond operators. This asymmetry is not present in Boolean Modal Logics, in which box and diamond quantify over arbitrary Boolean combinations of atomic modal parameters [9]. Boolean Modal Logics have been considered in various forms and contexts: 1. "Pure " Boolean Modal Logic has been studied in [9]. Negation and intersection of modal parameters occur in some variants of Propositional Dynamic Logic, see, e.g., [7, 16, 22].
Expressive number restrictions in Description Logics
 Journal of Logic and Computation
, 1999
"... Number restrictions are concept constructors that are available in almost all implemented Description Logic systems. However, they are mostly available only in a rather weak form, which considerably restricts their expressive power. On the one hand, the roles that may occur in number restrictions ar ..."
Abstract

Cited by 32 (7 self)
 Add to MetaCart
Number restrictions are concept constructors that are available in almost all implemented Description Logic systems. However, they are mostly available only in a rather weak form, which considerably restricts their expressive power. On the one hand, the roles that may occur in number restrictions are usually of a very restricted type, namely atomic roles or complex roles built using either intersection or inversion. In the present paper, we increase the expressive power of Description Logics by allowing for more complex roles in number restrictions. As role constructors, we consider composition of roles (which will be present in all our logics) and intersection, union, and inversion of roles in different combinations. We will present two decidability results (for the basic logic that extends ALC by number restrictions on roles with composition, and for one extension of this logic), and three undecidability results for three other extensions of the basic logic. On the other hand, with t...
Complexity Results for FirstOrder TwoVariable Logic with Counting
, 2000
"... Let C 2 p denote the class of first order sentences with two variables and with additional quantifiers "there exists exactly (at most, at least) i", for i p, and let C 2 be the union of C 2 p taken over all integers p. We prove that the satisfiability problem for C 2 1 sentences is NEXPTIMEcomplete ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
Let C 2 p denote the class of first order sentences with two variables and with additional quantifiers "there exists exactly (at most, at least) i", for i p, and let C 2 be the union of C 2 p taken over all integers p. We prove that the satisfiability problem for C 2 1 sentences is NEXPTIMEcomplete. This strengthens the results by E. Grädel, Ph. Kolaitis and M. Vardi [15] who showed that the satisfiability problem for the first order twovariable logic L 2 is NEXPTIMEcomplete and by E. Grädel, M. Otto and E. Rosen [16] who proved the decidability of C 2 . Our result easily implies that the satisfiability problem for C 2 is in nondeterministic, doubly exponential time. It is interesting that C 2 1 is in NEXPTIME in spite of the fact, that there are sentences whose minimal (and only) models are of doubly exponential size. It is worth noticing, that by a recent result of E. Gradel, M. Otto and E. Rosen [17], extensions of twovariables logic L 2 by a week access to car...