A.J. Bonner, The logical semantics of hypothetical rulebases with deletion, Journal of Logic Programming, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....A 2 B Sigma g. Soundness and completeness were proved in [7] Nevertheless, as in normal logic programming, the class of considered programs rule out many programs that solve interesting problems. Recent works of Bonner address other extensions of the language considered in [7] For instance, in [6] hypothetical deletion is considered but the class of programs treated remains stratified. 3.2 Modularity in Logic Programming In modular logic programming there are, mainly, two approaches. The first one is to combine several separate and independent components by using compositional operators. ....

A. J. Bonner. A logical semantics for hypothetical rulebases with deletion. Journal of Logic Programming, (32):119--170, 1997. 38

....To get 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, ....

A.J. Bonner. A logical semantics for hypothetical rulebases with deletion. Journal of Logic Programming, 32(2):119-170, August 1997. 46 LOGICS FOR DATABASES AND INFORMATION SYSTEMS

....A version of hypothetical relations is introduced in [WS83] While the work there describes carefully crafted implementation strategies for such relations, it cannot easily be extended to provide the full generality of delta usage supported in the Heraclitus framework. References [Gab85, Bon90, Bon95] consider extensions of datalog that incorporate hypothetical reasoning. That work is focused primarily on the development of a proof theory and model theory that includes hypothetical reasoning. Similar to Heraclitus[Alg,C] hypothetical changes to a database state are represented as sets of ....

A. J. Bonner. The logical semantics of hypothetical rulebases with deletion. Journal of Logic Programming, 1995. to appear.

....form or another: abductive reasoning infers (assumes) p from q given that p ) q; uncertain information with high probability is used (assumed) in some frameworks, and so on. Recently, systems for hypothetical reasoning that extend the capabilities of deductive databases have been studied e. g [4] and in the area of logic programming, assumptions have also been widely used, most notably for default reasoning (e.g. negation as failure) Independently, work on intuitionistic logic and, more recently, linear logic [12] has provided formally characterized embodiments of assumptions which have ....

A. J. Bonner. A logical semantics for hypothetical rulebases with deletion. Journal of Logic Programming, 32(2):119--170, 1997.

....To get 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, ....

A.J. Bonner. A logical semantics for hypothetical rulebases with deletion. Journal of Logic Programming, 32(2):119--170, August 1997.

.... if your father would be eligible if he were still alive [20] And McCarty, also motivated by legal applications, has developed a wide class of hypothetical rules for computer based consultation systems, especially systems for reasoning about corporate tax law and estate tax law [36, 38, 44] In [6, 5], we investigated hypothetical reasoning in deductive databases. We considered rules that can hypothetically insert or delete facts from a database. In [6] we showed that with both insertion and deletion, the data complexity of hypothetical inference is complete for EXPTIME, while with insertion ....

....for EXPTIME, while with insertion alone it is complete for PSPACE. Without hypothetical operations, the language reduces to Datalog (function free Horn logic) whose data complexity is complete for PTIME. We also proved completeness results on the logic s ability to express databases queries. In [5], we developed a logical semantics for hypothetical reasoning with insertion and deletion, including a proof theory, model theory and fixpoint theory. We then extended the semantics to account for negation as failure. Other researchers in the logic programming community have investigated the ....

[Article contains additional citation context not shown here]

A.J. Bonner. A logical semantics for hypothetical rulebases with deletion. To appear in the Journal of Logic Programming (JLP).

No context found.

A.J. Bonner, The logical semantics of hypothetical rulebases with deletion, Journal of Logic Programming, 1995.

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