Results 1  10
of
53
Complexity and Expressive Power of Logic Programming
, 1997
"... This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results ..."
Abstract

Cited by 362 (57 self)
 Add to MetaCart
This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming. The complexity of the unification problem is also addressed.
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 39 (5 self)
 Add to MetaCart
(Show Context)
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...
Logics with Aggregate Operators
 Journal of the ACM
"... We study adding aggregate operators, such as summing up elements of a column of a relation, to logics with counting mechanisms. The primary motivation comes from database applications, where aggregate operators are present in all real life query languages. Unlike other features of query languages, a ..."
Abstract

Cited by 29 (15 self)
 Add to MetaCart
We study adding aggregate operators, such as summing up elements of a column of a relation, to logics with counting mechanisms. The primary motivation comes from database applications, where aggregate operators are present in all real life query languages. Unlike other features of query languages, aggregates are not adequately captured by the existing logical formalisms. Consequently, all previous approaches to analyzing the expressive power of aggregation were only capable of producing partial results, depending on the allowed class of aggregate and arithmetic operations. We consider a powerful counting logic, and extend it with the set of all aggregate operators. We show that the resulting logic satis es analogs of Hanf's and Gaifman's theorems, meaning that it can only express local properties. We consider a database query language that expresses all the standard aggregates found in commercial query languages, and show how it can be translated into the aggregate logic, thereby pro...
Semantics and Expressiveness Issues in Active Databases
 J. OF COMPUTER AND SYSTEM SCIENCES
, 1995
"... A formal framework is introduced for studying the semantics and expressiveness of active databases. The power of various abstract trigger languages is characterized, and related to several major active database prototypes such as ARDL, HiPAC, Postgres, Starburst, and Sybase. This allows to forma ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
A formal framework is introduced for studying the semantics and expressiveness of active databases. The power of various abstract trigger languages is characterized, and related to several major active database prototypes such as ARDL, HiPAC, Postgres, Starburst, and Sybase. This allows to formally compare the expressiveness of the prototypes. The results provide insight into the programming paradigm of active databases, the interplay of various features, and their impact on expressiveness and complexity.
Local Normal Forms for FirstOrder Logic with Applications to Games and Automata
 DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
, 1998
"... ..."
Decidability and Undecidability Results for the Termination Problem of Active Database Rules
 In Proceedings of the 17th ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems
, 1998
"... Active database systems enhance the functionality of traditional databases through the use of active rules or `triggers'. One of the principal questions for such systems is that of termination  is it possible for the rules to recursively activate one another indefinitely, given an initial trig ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
(Show Context)
Active database systems enhance the functionality of traditional databases through the use of active rules or `triggers'. One of the principal questions for such systems is that of termination  is it possible for the rules to recursively activate one another indefinitely, given an initial triggering event. In this paper, we study the decidability of the termination problem, our aim being to delimit the boundary between the decidable and the undecidable. We present two families of rule languages, the one literal languages where each update is permitted to have just one atom in its body, and the unary languages where only unary relations may be updated, but higher arity relations may be accessed through views. Within each of these, we identify members close to the boundary of (un)decidability. Our context is similar to the while query language and the dynamics gives an interesting contrast to Datalog with negation; our results shed insights on the power of triggers as well as comparison of the termination problem to boundedness and query containment.
Querying Spatial Databases via Topological Invariants
 In PODS'98
, 1998
"... The paper investigates the use of topological annotations (called topological invariants) to answer topological queries in spatial databases. The focus is on the translation of topological queries against the spatial database into queries against the topological invariant. The languages considered ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
The paper investigates the use of topological annotations (called topological invariants) to answer topological queries in spatial databases. The focus is on the translation of topological queries against the spatial database into queries against the topological invariant. The languages considered are firstorder on the spatial database side, and fixpoint + counting, fixpoint, and firstorder on the topological invariant side. In particular, it is shown that fixpoint + counting expresses precisely all the ptime queries on topological invariants; if the regions are connected, fixpoint expresses all ptime queries on topological invariants. 1 Introduction Spatial data is an increasingly important part of database systems. It is present in a wide range of applications: geographic information systems, video databases, medical imaging, CADCAM, VLSI, robotics, etc. Different applications pose different requirements on query languages and therefore on the kind of spatial information th...
On the forms of locality over finite models
 In Proc. 12th IEEE Symp. on Logic in Computer Science (LICS'97
, 1996
"... ..."
(Show Context)
First Order Logic, Fixed Point Logic and Linear Order
, 1995
"... The Ordered conjecture of Kolaitis and Vardi asks whether fixedpoint logic differs from firstorder logic on every infinite class of finite ordered structures. In this paper, we develop the tool of bounded variable element types, and illustrate its application to this and the original conjectures o ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
The Ordered conjecture of Kolaitis and Vardi asks whether fixedpoint logic differs from firstorder logic on every infinite class of finite ordered structures. In this paper, we develop the tool of bounded variable element types, and illustrate its application to this and the original conjectures of McColm, which arose from the study of inductive definability and infinitary logic on proficient classes of finite structures (those admitting an unbounded induction). In particular, for a class of finite structures, we introduce a compactness notion which yields a new proof of a ramified version of McColm's second conjecture. Furthermore, we show a connection between a modeltheoretic preservation property and the Ordered Conjecture, allowing us to prove it for classes of strings (colored orderings). We also elaborate on complexitytheoretic implications of this line of research.