K. Ueda, Concurrent Logic/Constraint Programming: The Next 10 Years, this volume. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Adding Constraints to Logic-based Formalisms - Maher (1999) Self-citation (Logic) (Correct)
....be viewed as an incomplete proof procedure for logic programs because there is no search, and because there is an extra condition on the applicability of a rule which makes it possible for execution to halt without success or failure. However, this view distorts the focus on concurrent programming [58]. 3 Negation as failure can be expressed: to prove :q, demonstrate that execution of q finitely fails; if execution of q succeeds (gives an answer) then :q fails. Of the many concurrent logic programming languages proposed, flat GHC [57] is the cleanest and simplest. In flat GHC, the extra ....
K. Ueda, Concurrent Logic/Constraint Programming: The Next 10 Years, this volume.
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