A. Van Gelder, K. A. Ross, and J. S. Schlipf, "The Wellfounded Semantics for Logic Programming," Journal of the ACM, 38 (1991), pp. 620-650.  Home/Search   Document Not in Database   Summary   ACM   TOC   Related Articles   Check

.... predicate on rule labels. We impose some further expressive restrictions in D2LP, related especially to cyclicity of dependency between predicates, to ensure D2LP s well behavior semantically and computationally. The generalized version of Courteous LP s relies on the well founded semantics [10], which is computationally tractable (worst case polynomial time) for the ground case. Courteous LP s semantic well behavior includes having a unique (minimal) model that is consistent ( and are never both sanctioned as conclusions) D2LP inherits this same well behavior. D2LP inferencing ....

A. Van Gelder, K. A. Ross, and J. S. Schlipf, "The Wellfounded Semantics for Logic Programming," Journal of the ACM, 38 (1991), pp. 620-650.

....a three level loop. By size of a program, we mean the number of symbols, i.e. variables, constants, predicate symbols, logical operators, etc. The semantics of a GCLP is defined by the semantics of its corresponding OLP. There are two leading semantics for OLP: well founded semantics (WFS) [4] and stable model semantics. Some OLP programs do not have a stable model and some programs have more than one. Furthermore, even for a propositional program, determining whether it has a stable model is NP complete [15] 5 On the other hand, WFS assigns a unique three valued model to every ....

A. Van Gelder, K. A. Ross, and J. S. Schlipf, "The Well-founded Semantics for Logic Programming," Journal of the ACM, 38 (1991), pp. 620-650.

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