Anthony J. Bonner Rutgers University Department of Computer Science New...  Home/Search
Context Related
| toronto.edu/pub/bonner/paper...tcs90.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: toronto.edu:8020/people/...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an extension of Horn-clause logic which can hypothetically add and delete tuples from a database. Such logics have been discussed in the literature, but their complexities and expressibilities have remained an open question. This paper examines two such logics in the function-free, predicate case. It is shown, in particular, that augmenting Horn-clause logic with hypothetical addition increases its data-complexity from PTIME to PSPACE. When deletions are added as well, complexity... (Update)
Context of citations to this paper: More
.... by disallowing embedded universal quantifiers, we have a language that expresses exactly the database 2 EXAMPLES 18 queries in PSPACE [6]. Additional syntactic restrictions give us a family of languages that can express the database queries at each level of the polynomial...
.... is data complete for PSPACE in the function free predicate case (data complete for EXPTIME when hypothetical deletions are allowed) [4]. This paper extends this line of research by developing syntactic restrictions whose data complexity is less that PSPACE. Central to...
Cited by: More
Foundations of Semantic Web Databases - Carlos (2004) (Correct)
Knowledgebase Transformations - Grahne, Mendelzon, Revesz (1992) (Correct)
Intuitionistic Implication and Resolution - Hui-Bon-Hoa (Correct)
Similar documents (at the sentence level):
9.1%: Hypothetical Datalog: Complexity and Expressibility - Bonner (1988) (Correct)
Active bibliography (related documents): More All
0.4: Hypothetical Reasoning with Intuitionistic Logic - Bonner (1994) (Correct)
0.3: A Logical Semantics For Hypothetical Rulebases With Deletion - Bonner (1997) (Correct)
0.3: Expressing Database Queries with Intuitionistic Logic - Bonner, McCarty, Vadaparty (1989) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Hypothetical Datalog: Negation and Linear Recursion - Bonner (1989) (Correct)
0.2: Intuitionistic Deductive Databases And The Polynomial Time.. - Bonner (1997) (Correct)
0.2: Reusing and Modifying Rulebases by Predicate Substitution - Bonner, Imielinski (1997) (Correct)
Related documents from co-citation: More All
10: Prolog: an extension of Prolog with hypothetical implications (context) - Gabbay - 1985
7: Clausal Intuitionistic Logic (context) - McCarty - 1988
5: Structure and complexity of relational queries - Chandra, Harel - 1982
BibTeX entry: (Update)
A.J. Bonner. Hypothetical Datalog: Complexity and Expressibility. In Proceedings of the International Conference on Database Theory (ICDT), pages 144--160. Springer-Verlag, 1988. Published as volume 326 of Lecture Notes in Computer Science. http://citeseer.ist.psu.edu/bonner88hypothetical.html More
@article{ bonner90hypothetical,
author = "Anthony J. Bonner",
title = "Hypothetical Datalog: Complexity and Expressibility",
journal = "Theoretical Computer Science",
volume = "76",
number = "1",
pages = "3-51",
year = "1990",
url = "citeseer.ist.psu.edu/bonner88hypothetical.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
435 Towards a Theory of Declarative Knowledge (context) - Apt, Blair et al. - 1988
379 The Complexity of Relational Query Languages (context) - Vardi - 1982
248 The Semantics of Predicate Logic as a Programming Language (context) - Van Emden, Kowalski - 1976
245 Relational Queries Computable in Polynomial Time - Immerman - 1982
198 Structure and Complexity of Relational Queries - Chandra, Harel - 1980
189 Computable Queries for Relational Databases - Chandra, Harel - 1980
182 Logic for Problem Solving (context) - Kowalski - 1979
149 A Logical Analysis of Modules in Logic Programming (context) - Miller - 1986
144 Contributions to the Theory of Logic Programming (context) - Apt, Van Emden - 1982
130 The Computational Complexity of Provability in Systems of Pr.. (context) - Ladner - 1977
124 Journal of the ACM (context) - Chandra, Kozen et al. - 1981
82 Prolog: an Extension of Prolog with Hypothetical Implication.. (context) - Gabbay, Reyle - 1984
82 Prolog: an Extension of Prolog with Hypothetical Implication.. (context) - Gabbay - 1985
59 A Logic-based Language for Database Updates (context) - Manchanda, Warren - 1988
55 Clausal Intuitionistic Logic (context) - McCarty - 1988
55 Clausal Intuitionistic Logic (context) - McCarty - 1988
25 Intuitionistic Propositional Logic is Polynomial-Space Compl.. (context) - Statman - 1979
18 Database Updates in Pure Prolog (context) - Warren - 1984
16 A Transaction Language Complete for Database Update Specific.. (context) - Abiteboul, Vianu - 1987
12 A Logic for Hypothetical Reasoning - Bonner - 1988
8 Horn Clauses and the Fixpoint Query Hierarchy (context) - Chandra, Harel - 1982
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.db.toronto.edu:8020/people/bonner/papers.html): More
Adding Negation-as-Failure to Intuitionistic Logic Programming - Bonner, McCarty (1992) (Correct)
A Flexible Approach to Genome Map Assembly - Harley, Bonner (1994) (Correct)
Hypothetical Datalog: Complexity and Expressibility - Bonner (1988) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC