A.J. Bonner. Intuitionistic deductive databases and the polynomial time hierarchy. Journal of Logic Programming, 33(1):1-47, October 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Logics for Databases and Information Systems - Chomicki, (eds.) (1998) (15 citations) (Correct)
....a better grasp of the idea of an oracle as database state, Section 1.4.3 provides some typical examples. 1.4.2 State Transition Oracles The next step is to specify elementary changes to the database. One way to de ne such changes is to build them into the semantics, as in [MW88; NK88; Bon97b; Bon97a; Che91; AV90; McC83] The problem with this approach is that adding new kinds of elementary transitions requires rede ning the very notion of a model and, hence, entails a revamping of the entire theory, including the need to reprove soundness and completeness results. In other words, such ....
A.J. Bonner. Intuitionistic deductive databases and the polynomial time hierarchy. Journal of Logic Programming, 33(1):1-47, October 1997.
A Logical Semantics For Hypothetical Rulebases With Deletion - Bonner (1997) (5 citations) Self-citation (Bonner) (Correct)
....of the logic. We showed, for instance, that its data complexity is complete for EXPTIME. By augmenting the logic with negation as failure, and by considering stratified rulebases, the logic expresses all database queries in EXPTIME [10] in the sense defined by Chandra and Harel [20] In [10, 9, 7, 11, 12], we extended these results to lower complexity classes PSPACE, PHIER, Sigma P k and NP for various fragments of the logic. It is interesting that all these complexity classes can be characterized by a single language with a natural series of syntactic restrictions. In those papers, we ....
....many stratified rulebases. We discuss these works in greater detail in Section 7. The problems encountered all reflect the difficulty of dealing with recursion through negation. Fortunately, none of our complexity and expressibility results depend on recursion through negation. For instance, in [10, 9, 7, 18, 12, 11], we show that stratified hypothetical rules are expressively complete for many well known complexity classes. In [9, 7] we show that each stratum can raise the complexity of inference by one level in the polynomial time hierarchy. In addition to these complexitytheoretic properties, it is worth ....
[Article contains additional citation context not shown here]
A.J. Bonner. Intuitionistic deductive databases and the polynomial time hierarchy. Submitted for publication.
A Logic For Programming Database Transactions - Bonner, Kifer (1998) (6 citations) Self-citation (Bonner) (Correct)
....a better grasp of the idea of an oracle as database state, Section 1.4.3 provides some typical examples. 1.4.2 State Transition Oracles The next step is to specify elementary changes to the database. One way to define such changes is to build them into the semantics, as in [MW88; NK88; Bon97b; Bon97a; Che91; AV90; McC83] The problem with this approach is that adding new kinds of elementary transitions requires redefining the very notion of a model and, hence, entails a revamping of the entire theory, including the need to reprove soundness and completeness results. In other words, such ....
A.J. Bonner. Intuitionistic deductive databases and the polynomial time hierarchy. Journal of Logic Programming, 33(1):1--47, October 1997.
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