Filters








9 Hits in 7.8 sec

Extending stratified datalog to capture complexity classes ranging from ${\cal P} to {\cal QH}$

Sergio Greco, Domenico Saccà, Carlo Zaniolo
2001 Acta Informatica  
This paper presents a unified solution to the problem of extending stratified DATALOG to express database complexity classes ranging from P to QH; QH is the query hierarchy containing the decision problems  ...  The solution is based on (i) stratified negation as the core of a simple, declarative semantics for negation, (ii) the use of a "choice" construct to capture the nondeterminism of stable models in a disciplined  ...  In summary, our language incrementally extends stratified negation to capture decision problems ranging from P up to QH, passing through various interesting subclasses of QH such as N P, coN P and D p  ... 
doi:10.1007/pl00013306 fatcat:44olmfk7srfnrkwis3yvhxanka

Page 1303 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
stratified DATALOG to capture complexity classes ranging from P to QH.  ...  Summary: “This paper presents a unified solution to the problem of extending stratified DATALOG to express database complexity classes ranging from P to QH; QH is the query hierarchy contain- ing the decision  ... 

The Complexity and Expressive Power of Limit Datalog

Mark Kaminski, Egor V. Kostylev, Bernardo Cuenca Grau, Boris Motik, Ian Horrocks
2022 Journal of the ACM  
In particular, limit-linear Datalog Z is complete for Δ 2 EXP and captures Δ 2 P over ordered datasets in the sense of descriptive complexity.  ...  this allows us to transfer decidability and complexity upper bounds from limit programs to other formalisms.  ...  The ability of a Datalog Z fragment to capture a complexity class immediately implies hardness of the corresponding fact entailment problem for this class in data complexity. Proposition 2.3.  ... 
doi:10.1145/3495009 fatcat:m4r4o3vdw5bb5jhtlousdzoi5y

Datalog extensions for database queries and updates

Serge Abiteboul, Victor Vianu
1991 Journal of computer and system sciences (Print)  
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  ...  Recently, much of that research revolved around attempts to develop extensions of Datalog with increased expressive power, providing forms of non-monotonic reasoning (see [Ap, Ka, U]).  ...  It has been shown that many complexity classes of transformations can be captured by deterministic languages in the presence of order [12] .  ... 
doi:10.1016/0022-0000(91)90032-z fatcat:gmpg7xfplvhanktfyjwhy2jw6m

A language for updating logic programs and its implementation

Nicola Leone, Luigi Palopoli, Massimo Romeo
1995 The Journal of Logic Programming  
The computational complexity of the proposed implementation is also analyzed, showing that the update language interpreter runs efficiently. Finally, three extensions to ULL are discussed.  ...  Thus, simple control structures are defined for combining the basic updates into programs capable of expressing complex updates.  ...  Special thanks to the anonymous referees for very useful comments and suggestions that significantly improved the quality of this paper.  ... 
doi:10.1016/0743-1066(94)00025-2 fatcat:rhuekdv57rgdtjc3x24vaz25ue

Algebraic and calculus query languages for recursively typed complex objects

Richard Hull, Jianwen Su
1993 Journal of computer and system sciences (Print)  
Relative to mappings from flat relations to flat relations, the algebra without while has the expressive power of the algebra on conventional complex objects with non-recursive types.  ...  A technical tool, called "domain Turing machine," is introduced and applied to characterize the expressive power of several classes of relational queries.  ...  The authors also thank Serge Abiteboul and anonymous referees for their detailed comments leading to the improvements of the paper.  ... 
doi:10.1016/0022-0000(93)90022-o fatcat:5rbtnj5ymrayxcpo2zgrcowhye

Page 2008 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
C. see Pérez-Jiménez, Mario J. et al., (2003a:00034) Greco, Sergio (with Sacca, Domenico; Zaniolo, Carlo) Extending stratified DATALOG to capture complexity classes ranging from P to QH.  ...  (with Sohoni, Milind) Geometric complexity theory. I. An approach to the P vs. NP and related problems.  ... 

Page 2374 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
(Dominique Lépingle) 2003i:60043 60F10 (60H10) Zaniolo, Carlo (with Greco, Sergio; Sacca, Domenico) Extending stratified DATALOG to capture complexity classes ranging from P to QH.  ...  P.) Lagrangian for the t-J model constructed from the generators of the supersymmetric Hubbard algebra. (English summary) Jnternat. J. Theoret. Phys. 41 (2002), no. 6, 1053-1082.  ... 

4th Workshop "Methods for Modalities" (M4M) [article]

Holger Schlingloff, Humboldt-Universität Zu Berlin, Humboldt-Universität Zu Berlin
2017
(to be read right-associatively). This does not mean that considering even larger classes of properties will result in even more pathological examples.  ...  As mentioned above, higher expressive power requires higher computational complexity.  ...  Acknowledgements We would like to thank the anonymous referees for their helpful comments and suggestions.  ... 
doi:10.18452/2459 fatcat:cioisdqqkzbmnmwamy3gysoj7u