| P. Dung. Hypothetical Logic Programming. Proceedings of the Third International Workshop on Extensions of Logic Programming 61-73, Bologna, February, 1992. |
....resources need be consumed by the test. 3. 7 Counting clauses Another example in which the properties of linear logic make a significant simplification is in the following problem, which has been discussed as a motivation for the use of embedded implications in the presence of Negation as Failure [4, 5]. The problem can be stated thus: given a number of clauses r(1) r(n) how can we determine whether n is odd or even The program below has been used for this purpose. even : not odd. odd : select(X) mark(X) even) select(X) r(X) not mark(X) Note the dependence on the ....
P. Dung. Hypothetical Logic Programming. Proceedings of the Third International Workshop on Extensions of Logic Programming 61-73, Bologna, February, 1992.
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