Anthony J. Bonner  Home/Search
Context Related
| toronto.edu/pub/bonner/pape...pods89.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: This paper examines an extension of Horn logic in which rules can add entries to a database hypothetically. Several researchers have developed logical systems along these lines, but the complexity and expressibility of such logics is only now being explored. It has been shown, for instance, that the data-complexity of these logics is PSPACE-complete in the function-free, predicate case. This paper extends this line of research by developing syntactic restrictions with lower complexity. These... (Update)
Context of citations to this paper: More
...updated rather than a logic for performing updates. Bonner has carried out a thorough analysis of reasoning in Hypothetical Datalog [8, 10, 9, 7, 6], including a sophisticated complexity analysis. Like T R, this work combines elementary updates into complex transactions. Both...
...inference. Our work has considered a variety of hypothetical operations, including insertion, deletion and bulk updates [11, 10, 15, 12, 13, 14, 9, 8]. This paper, however, focuses on two specific operations: i) adding formulas to a database hypothetically ( insertion )...
Cited by: More
The Complexity of Nested Counterfactuals and Iterated.. - Eiter, Gottlob (1993) (Correct)
On the Complexity of Propositional Knowledge Base Revision.. - Eiter, Gottlob (1992) (Correct)
A Logical Semantics For Hypothetical Rulebases With Deletion - Bonner (1997) (Correct)
Similar documents (at the sentence level):
5.1%: Hypothetical Datalog: Complexity and Expressibility - Bonner (1988) (Correct)
Active bibliography (related documents): More All
0.3: Expressing Database Queries with Intuitionistic Logic - Bonner, McCarty, Vadaparty (1989) (Correct)
0.3: Circumscribing Embedded Implications (Without Stratifications) - McCarty (1992) (Correct)
0.2: A Logic for Hypothetical Reasoning - Bonner (1988) (Correct)
Similar documents based on text: More All
0.1: Hypothetical Reasoning with Intuitionistic Logic - Bonner (1994) (Correct)
0.1: Intuitionistic Deductive Databases And The Polynomial Time.. - Bonner (1997) (Correct)
0.1: Adding Negation-as-Failure to Intuitionistic Logic Programming - Bonner, McCarty (1992) (Correct)
Related documents from co-citation: More All
12: Prolog: an extension of Prolog with hypothetical implications (context) - Gabbay - 1985
11: Clausal Intuitionistic Logic (context) - McCarty - 1988
8: A Logic for Hypothetical Reasoning - Bonner - 1988
BibTeX entry: (Update)
A.J. Bonner. Hypothetical Datalog: Negation and Linear Recursion. In Proceedings of the ACM Symposium on the Principles of Database Systems (PODS), pages 286--300, Philadelphia, PA, March 1989. http://citeseer.ist.psu.edu/bonner89hypothetical.html More
@inproceedings{ bonner89hypothetical,
author = "A. J. Bonner",
title = "Hypothetical datalog negation and linear recursion",
pages = "286--300",
year = "1989",
url = "citeseer.ist.psu.edu/bonner89hypothetical.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
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
245 Relational Queries Computable in Polynomial Time - Immerman - 1982
204 the Declarative Semantics of Deductive Databases and Logic P.. (context) - Przymusinski - 1988
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
147 An Amateur's Introduction to Recursive Query Processing Stra.. (context) - Bancilhon, Ramakrishnan - 1986
129 Theoretical Computer Science (context) - Stockmeyer, Time - 1976
91 Artificial Intelligence (context) - Counterfactuals - 1986
82 Prolog: an Extension of Prolog with Hypothetical Implication.. (context) - Gabbay - 1985
82 Prolog: an Extension of Prolog with Hypothetical Implication.. (context) - Gabbay, Reyle - 1984
55 Clausal Intuitionistic Logic (context) - McCarty - 1988
55 Clausal Intuitionistic Logic (context) - McCarty - 1988
12 A Logic for Hypothetical Reasoning - Bonner - 1988
8 The Representation of an Evolving System of Legal Concepts (context) - McCarty, Sridharan - 1981
7 Hypothetical Datalog: Complexity and Expressibility - Bonner - 1988
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