Filters








268 Hits in 2.0 sec

Fundamental properties of deterministic and nondeterministic extensions of Datalog

Serge Abiteboul, Eric Simon
1991 Theoretical Computer Science  
Fundamental properties of deterministic and nondeterministic extensions of Datalog from Abiteboul and Vianu (1988) are studied.  ...  Abiteboul, S. and E. Simon, Fundamental properties of deterministic and nondeterministic extensions of Datalog, Theoretical Computer Science 78 (1991) 137-158.  ...  Acknowledgment We thank Victor Vianu for very carefully reading a first draft of this paper and his many comments. 158 S. Abiteboul, E. Simon  ... 
doi:10.1016/0304-3975(51)90006-0 fatcat:gjngdaf4rvai3cqdn5z72yl7u4

Datalog Unchained

Victor Vianu
2021 Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems  
Datalog variants with forward chaining semantics have been adopted in a variety of settings, including active databases, production systems, distributed data exchange, and data-driven reactive systems.  ...  This is the companion paper of a talk in the Gems of PODS series, that reviews the development, starting at PODS 1988, of a family of Datalog-like languages with procedural, forward chaining semantics,  ...  The author is grateful to Pierre Bourhis and Luc Segoufin for their insightful comments on this paper.  ... 
doi:10.1145/3452021.3458815 fatcat:b6mnoptf2jgdtl27xrt54z7r5u

Page 1037 of Mathematical Reviews Vol. , Issue 92b [page]

1992 Mathematical Reviews  
Summary: “Fundamental properties of deterministic and nonde- terministic extensions of Datalog from Abiteboul and V.  ...  Bernhard Thalheim (Rostock) 92b:68027 68P20 68N15 Abiteboul, Serge (F-INRIA); Simon, Eric (F-INRIA) Fundamental properties of deterministic and nondeterministic extensions of Datalog.  ... 

Datalog extensions for database queries and updates

Serge Abiteboul, Victor Vianu
1991 Journal of computer and system sciences (Print)  
Deterministic and non-deterministic extensions of Datalog with fixpoint semantics are proposed, and their expressive power characterized.  ...  The Datalog extensions range from complete languages to languages capturing interesting complexity classes of queries and updates: PTIME and PSPACE in the non-deterministic case, and the tixpoint queries  ...  We first consider extensions N-Datalog:* and N-Datalog * of the non-deterministic languages (N-Datalog: and N-Datalog'), then extensions Datalog;* and Datalog' * of the deterministic ones (Datalog: and  ... 
doi:10.1016/0022-0000(91)90032-z fatcat:gmpg7xfplvhanktfyjwhy2jw6m

Set Constraints in Logic Programming [chapter]

Victor W. Marek, Jeffrey B. Remmel
2003 Lecture Notes in Computer Science  
Our programs admit atoms of the form X, F where X is a finite set of propositional atoms and F is an arbitrary family of subsets of X.  ...  We call such atoms set constaints and show that the concept of stable model can be generalized to programs admitting set constraints both in the bodies and the heads of clauses.  ...  Acknowledgments The first author's research has been partially supported by the NSF grants IIS-0097278 and IIS-0325063.  ... 
doi:10.1007/978-3-540-24609-1_16 fatcat:otj5g45pmbaujnzhw6k4gt2kzi

Datalog with non-deterministic choice computes NDB-PTIME

Fosca Giannotti, Dino Pedreschi
1998 The Journal of Logic Programming  
This paper addresses the issue of non-deterministic extensions of logic database languages.  ...  A first batch of proposals is due to Abiteboul and Vianu [6, [9] [10] [11] , based on a non-deterministic witness construct for the fixpoint extensions of FO, and a non-deterministic operational semantics  ...  Thanks are also owing to Victor Vianu, Luigi Palopoli, Carlo Zaniolo and Mimmo Sacc~ for their useful suggestions on the subject of this paper.  ... 
doi:10.1016/s0743-1066(97)10004-8 fatcat:nu7u6i6qjjhkble22k2sbobqim

Complexity and expressive power of logic programming

Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
2001 ACM Computing Surveys  
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.  ...  This paper surveys various complexity and expressiveness results on different forms of logic programming.  ...  In particular, we appreciate the many and extremely valuable comments of Leonid Libkin.  ... 
doi:10.1145/502807.502810 fatcat:534rdwm6fbdmtn6ghdsntvca5e

Complexity of Arithmetic in Warded Datalog+- [article]

Lucas Berent, Markus Nissl, Emanuel Sallinger
2022 arXiv   pre-print
The theoretical efficiency guarantees of Warded Datalog+- do not cover extensions crucial for data analytics, such as arithmetic.  ...  We lay the theoretical foundation for highly expressive Datalog+- languages that combine the power of advanced recursive rules and arithmetic while guaranteeing efficient reasoning algorithms for applications  ...  Acknowledgements This work was supported by the Vienna Science and Technology Fund (WWTF) grant VRG18-013, and the "rAIson data" Royal Society grant of Prof. Georg Gottlob.  ... 
arXiv:2202.05086v1 fatcat:dnhm5jem2resri7mvrvrm7cssa

Low complexity aggregation in graphlog and Datalog [chapter]

Mariano P. Consens, Alberto O. Mendelzon
1990 Lecture Notes in Computer Science  
We show how Datalog can be extended to compute a large class of queries with aggregates without incurring the large expense of a language with general set manipulation capabilities.  ...  We present constructs for computing aggregate functions over sets of tuples and along paths in a database graph.  ...  Acknowledgments We are indebted to Isabel Cruz for fruitful discussions and Steve Cook for his help with the ner points of parallel complexity theory.  ... 
doi:10.1007/3-540-53507-1_90 fatcat:2g6qdn6z6zdvzaenawkarx5rtq

The Complexity of Boundedness for Guarded Logics

Michael Benedikt, Balder Ten Cate, Thomas Colcombet, Michael Vanden Boom
2015 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science  
It is known that guarded logics have many desirable computational and model theoretic properties, including in some cases decidable boundedness.  ...  In this paper, we study the boundedness problem when φ is in the guarded fragment or guarded negation fragment of first-order logic, or the fixpoint extensions of these logics.  ...  Like modal logic, the fixpoint extensions of these guarded logics are decidable and have nice model theoretic properties too.  ... 
doi:10.1109/lics.2015.36 dblp:conf/lics/BenediktCCB15 fatcat:dfty4xxupfgnzb4wjmt3rz4ys4

Tiresias

Alexandra Meliou, Dan Suciu
2012 Proceedings of the 2012 international conference on Management of Data - SIGMOD '12  
extensions to standard Datalog.  ...  (d) Finally, an extensive performance evaluation on the TPC-H dataset demonstrates the effectiveness of these optimizations, particularly highlighting the ability to apply divide-and-conquer methods to  ...  For example disjunctive datalog (DL) is a powerful extension of datalog used for knowledge representation and reasoning; DLV is an advanced implementation of disjunctive datalog [19] .  ... 
doi:10.1145/2213836.2213875 dblp:conf/sigmod/MeliouS12 fatcat:v37orjkbpzgz5hqynjmqviztxq

Expressiveness and Complexity of Formal Systems [chapter]

Giorgio Ausiello, Luca Cabibbo
1999 Functional Models of Cognition  
Finally, the concept of succinctness of a formal system is taken into consideration and it is shown that the role of succinctness in affecting the complexity of formal systems is crucial.  ...  An "optimal" balance between expressive power and complexity is the key that explains the success of some formal systems and languages that are widely used in computer science and applications.  ...  two fundamental characteristics: soundness (may the properties of the model be suitably interpreted in the system?)  ... 
doi:10.1007/978-94-015-9620-6_7 fatcat:s66seglujrf4bohfdd6ul2ibsy

Highly expressive query languages for unordered data trees

Serge Abiteboul, Pierre Bourhis, Victor Vianu
2012 Proceedings of the 15th International Conference on Database Theory - ICDT '12  
The results highlight the impact and interplay of different factors: the expressive power of basic queries, the embedding of computation into data (as in Active XML), and the use of deterministic vs. nondeterministic  ...  We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family.  ...  of data and computation, (ii) the use of tree versus data variables and (iii) the use of deterministic vs. nondeterministic control.  ... 
doi:10.1145/2274576.2274583 dblp:conf/icdt/AbiteboulBV12 fatcat:cpzme4274jdg3l5juyr5akcpya

Highly Expressive Query Languages for Unordered Data Trees

Serge Abiteboul, Pierre Bourhis, Victor Vianu
2015 Theory of Computing Systems  
The results highlight the impact and interplay of different factors: the expressive power of basic queries, the embedding of computation into data (as in Active XML), and the use of deterministic vs. nondeterministic  ...  We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family.  ...  of data and computation, (ii) the use of tree versus data variables and (iii) the use of deterministic vs. nondeterministic control.  ... 
doi:10.1007/s00224-015-9617-5 fatcat:xjdvbe5t2nborpizm6w55mjknq

On the Power of Deterministic Transitive Closures

E. Gradel, G.L. Mccolm
1995 Information and Computation  
In fact, on certain classes of graphs, such as hypercubes or regular graphs of large degree and girth, every DTC-query is bounded and therefore rst order expressible.  ...  We show that transitive closure logic (FO + TC) is strictly more powerful than deterministic transitive closure logic (FO + DTC) on nite (unordered) structures.  ...  In fact, TC is one of the common examples that are usually given when extensions of rst-order logic such as xpoint logic (FO + LFP) or query languages like Datalog are introduced.  ... 
doi:10.1006/inco.1995.1081 fatcat:mlxysq557rdulfmn7n4xntmltu
« Previous Showing results 1 — 15 out of 268 results