Russell Greiner. The complexity of revising logic programs. The Journal of Logic Programming, 40:273--298, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of the Horn theory. Similarly, belief revision systems [AGM85, Dal88, Gar88, KM91] take as input an 2 (1) However, we make no claims concerning the applicability of our techniques to systems like KBANN [Tow91] which use a completely different means of modifying a theory. 2) The companion paper [Gre99] considers yet other ways of modifying a theory, viz. by rearranging the order of its component rules or antecedents. The Complexity of Theory Revision 5 initial theory T 0 and a new assertion hq; i (resp. a new retraction hr; Gammai) and return a new consistent theory T 0 that entails q ....

....T) albeit at a cost of c( DR b: Gammaf ffi AR b: Gammaf ) 6. 7 As we are dealing with a pure version of logic programs, and seeking all answers to each query, the order of these antecedents will not matter. Similarly, the order of rules is also irrelevant in this model. The companion paper [Gre99] considers alternative models in which these orders can matter. The Complexity of Theory Revision 11 Finally, we will also consider various other spaces of transformations, of the form Upsilon A=k 1 ; R=k 2 ; GammaA=k 3 ; GammaR=k 4 = 8 : AE = 1 ffi 2 ffi : ffi ....

[Article contains additional citation context not shown here]

Russell Greiner. The complexity of revising logic programs. Journal of Logic Programming, 1999, to appear. http://www.cs.ualberta.ca/greiner/PAPERS/impure.ps.

No context found.

Russell Greiner. The complexity of revising logic programs. The Journal of Logic Programming, 40:273--298, 1999.

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