Results 1  10
of
60
Towards Tractable Algebras for Bags
, 1993
"... Bags, i.e. sets with duplicates, are often used to implement relations in database systems. In this paper, we study the expressive power of algebras for manipulating bags. The algebra we present is a simple extension of the nested relation algebra. Our aim is to investigate how the use of bags in ..."
Abstract

Cited by 58 (4 self)
 Add to MetaCart
Bags, i.e. sets with duplicates, are often used to implement relations in database systems. In this paper, we study the expressive power of algebras for manipulating bags. The algebra we present is a simple extension of the nested relation algebra. Our aim is to investigate how the use of bags in the language extends its expressive power, and increases its complexity. We consider two main issues, namely (i) the impact of the depth of bag nesting on the expressive power, and (ii) the complexity and the expressive power induced by the algebraic operations. We show that the bag algebra is more expressive than the nested relation algebra (at all levels of nesting), and that the difference may be subtle. We establish a hierarchy based on the structure of algebra expressions. This hierarchy is shown to be highly related to the properties of the powerset operator. Invited to a special issue of the Journal of Computer and System Sciences selected from ACM Princ. of Database Systems,...
Infinitary Logics and 01 Laws
 Information and Computation
, 1992
"... We investigate the in nitary logic L 1! , in which sentences may have arbitrary disjunctions and conjunctions, but they involve only a nite number of distinct variables. We show that various xpoint logics can be viewed as fragments of L 1! , and we describe a gametheoretic characterizat ..."
Abstract

Cited by 42 (4 self)
 Add to MetaCart
We investigate the in nitary logic L 1! , in which sentences may have arbitrary disjunctions and conjunctions, but they involve only a nite number of distinct variables. We show that various xpoint logics can be viewed as fragments of L 1! , and we describe a gametheoretic characterization of the expressive power of the logic. Finally, we study asymptotic probabilities of properties 1! on nite structures. We show that the 01 law holds for L 1! , i.e., the asymptotic probability of every sentence in this logic exists and is equal to either 0 or 1. This result subsumes earlier work on asymptotic probabilities for various xpoint logics and reveals the boundary of 01 laws for in nitary logics.
Fixpoint Logics, Relational Machines, and Computational Complexity
 In Structure and Complexity
, 1993
"... We establish a general connection between fixpoint logic and complexity. On one side, we have fixpoint logic, parameterized by the choices of 1storder operators (inflationary or noninflationary) and iteration constructs (deterministic, nondeterministic, or alternating). On the other side, we have t ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
We establish a general connection between fixpoint logic and complexity. On one side, we have fixpoint logic, parameterized by the choices of 1storder operators (inflationary or noninflationary) and iteration constructs (deterministic, nondeterministic, or alternating). On the other side, we have the complexity classes between P and EXPTIME. Our parameterized fixpoint logics capture the complexity classes P, NP, PSPACE, and EXPTIME, but equality is achieved only over ordered structures. There is, however, an inherent mismatch between complexity and logic  while computational devices work on encodings of problems, logic is applied directly to the underlying mathematical structures. To overcome this mismatch, we develop a theory of relational complexity, which bridges tha gap between standard complexity and fixpoint logic. On one hand, we show that questions about containments among standard complexity classes can be translated to questions about containments among relational complex...
On Winning Strategies With Unary Quantifiers
 J. Logic and Computation
, 1996
"... A combinatorial argument for two finite structures to agree on all sentences with bounded quantifier rank in firstorder logic with any set of unary generalized quantifiers, is given. It is known that connectivity of finite structures is neither in monadic \Sigma 1 1 nor in L !! (Q u ), where Q ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
A combinatorial argument for two finite structures to agree on all sentences with bounded quantifier rank in firstorder logic with any set of unary generalized quantifiers, is given. It is known that connectivity of finite structures is neither in monadic \Sigma 1 1 nor in L !! (Q u ), where Q u is the set of all unary generalized quantifiers. Using this combinatorial argument and a combination of secondorder EhrenfeuchtFra iss'e games developed by Ajtai and Fagin, we prove that connectivity of finite structures is not in monadic \Sigma 1 1 with any set of unary quantifiers, even if sentences are allowed to contain builtin relations of moderate degree. The combinatorial argument is also used to show that no class (if it is not in some sense trivial) of finite graphs defined by forbidden minors, is in L !! (Q u ). Especially, the class of planar graphs is not in L !! (Q u ). 1. Introduction The expressive power of firstorder logic L !! is rather limited. This is beca...
The complexity of graph connectivity
, 1992
"... In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging open problems. 1 ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging open problems. 1
Logics For ContextFree Languages
, 1995
"... We define matchings, and show that they capture the essence of contextfreeness. More precisely, we show that the class of contextfree languages coincides with the class of those sets of strings which can be defined by sentences of the form 9 b', where ' is first order, b is a binary pre ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
We define matchings, and show that they capture the essence of contextfreeness. More precisely, we show that the class of contextfree languages coincides with the class of those sets of strings which can be defined by sentences of the form 9 b', where ' is first order, b is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings. Several variations and extensions are discussed.
Datalog and Description Logics: Expressive Power
, 1997
"... . Recently there was some attention on integration of description logics of the ALfamily with rulebased languages for querying relational databases such as Datalog, so as to achieve the best characteristics of both kinds of formalisms in a common framework. Formal analysis on such hybrid languages ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
. Recently there was some attention on integration of description logics of the ALfamily with rulebased languages for querying relational databases such as Datalog, so as to achieve the best characteristics of both kinds of formalisms in a common framework. Formal analysis on such hybrid languages has been limited to computational complexity: i.e., how much time/space it is needed to answer to a specific query? This paper carries out a different formal analysis, the one dealing with expressiveness, which gives precise characterization of the concepts definable as queries. We first analyze the applicability to hybrid languages of formal tools developed for characterizing the expressive power of relational query languages. We then present some preliminary results on the expressiveness of hybrid languages. In particular, we show that relatively simple hybrid languages are able to define all finite structures expressed by skolemized universally quantified secondorder formulae with some ...
The Closure of Monadic NP
 Journal of Computer and System Sciences
, 1997
"... It is a wellknown result of Fagin that the complexity class NP coincides with the class of ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
It is a wellknown result of Fagin that the complexity class NP coincides with the class of
On Winning Ehrenfeucht Games and Monadic NP
 Annals of Pure and Applied Logic
, 1996
"... Inexpressibility results in Finite Model Theory are often proved by showing that Duplicator, one of the two players of an Ehrenfeucht game, has a winning strategy on certain structures. In this article a new method is introduced that allows, under certain conditions, the extension of a winning strat ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
Inexpressibility results in Finite Model Theory are often proved by showing that Duplicator, one of the two players of an Ehrenfeucht game, has a winning strategy on certain structures. In this article a new method is introduced that allows, under certain conditions, the extension of a winning strategy of Duplicator on some small parts of two finite structures to a global winning strategy. As applications of this technique it is shown that (*) Graph Connectivity is not expressible in existential monadic secondorder logic (MonNP), even in the presence of a builtin linear order, (*) Graph Connectivity is not expressible in MonNP even in the presence of arbitrary builtin relations of degree n^o(1), and (*) the presence of a builtin linear order gives MonNP more expressive power than the presence of a builtin successor relation.