R. Barbuti, P. Mancarella, D. Pedreschi and F. Turini, "Intensional Negation of Logic Programs: Examples and Implementation Techniques," proceedings of International Joint Conference on Theory and Practice of Software Development TAPSOFT '87 (Springer Verlag, LNCS 250, 1987) pp. 96-110, Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Extra Variables in (Equational) Logic Programming - Hanus (1994) (Correct)
....of nonterminating functions and extra variables in right hand sides of rewrite rules. 1 Introduction Extra variables in a Horn clause L ( B are variables in the body B which do not occur in L (other notions are existential variables [PP94] local variables [BMPT90] right free variables [BMPT87] or fresh variables [Pad92] It has been argued that extra variables are necessary and contribute to the expressive power of logic languages. For instance, Dershowitz and Okada [DO90] claim that the restriction of logic programming to clauses without extra variables is unacceptable since even ....
R. Barbuti, P. Mancarella, D. Pedreschi, and F. Turini. Intensional Negation of Logic Programs: Examples and Implementation Techniques. In Proc. of the TAPSOFT '87, pp. 96--110. Springer LNCS 250, 1987.
Compilative Constructive Negation in Constraint Logic.. - Bruscoli, Levi, Levi, Meo (1994) (8 citations) (Correct)
....to the non ground literal problem, namely the fact that Negation As Failure can only be used as a test and never computes answers. The problem of handling non ground literals was tackled by various extensions of Negation As Failure, called constructive negation. Examples are intensional negation [3, 4], Chan s constructive negation [7, 8] fail substitutions [20] and fail answers [11, 10] The idea of intensional negation, originally sketched in [25] and then formalized for positive logic programs in [3, 4] is the following. Given a normal program P , we derive a new program P 0 , which ....
....of Negation As Failure, called constructive negation. Examples are intensional negation [3, 4] Chan s constructive negation [7, 8] fail substitutions [20] and fail answers [11, 10] The idea of intensional negation, originally sketched in [25] and then formalized for positive logic programs in [3, 4], is the following. Given a normal program P , we derive a new program P 0 , which contains clauses which allow us to compute the answers to negative queries. Example 1. Let P be the program feven(0) even(s(s(X) even(X)g. The new clauses in P 0 generated by intensional negation are the ....
R. Barbuti, P. Mancarella, D. Pedreschi, and F. Turini. Intensional Negation of Logic Programs: Examples and Implementation Techniques. In H. Ehrig, R. Kowalski, G. Levi, and U. Montanari, editors, TAPSOFT '87, volume 250 of Lecture Notes in Computer Science, pages 96--110. Springer-Verlag, Berlin, 1987.
Intensional Negation in Constraint Logic Programs - Bruscoli, Levi, Levi, Meo (1993) (3 citations) (Correct)
....the non ground literal problem, namely the fact that Negation As Failure can only be used as a test and never computes answers. The problem of handling non ground literals was tackled by various extensions of Negation As Failure, called constructive negation. Examples are intensional negation [3, 4], Chan s constructive negation [6, 7] the fail substitutions [23] and the fail answers [10, 9] techniques. The idea of intensional negation, originally formalized for positive logic programs [3, 4] is the following. Given a normal program P , we derive a new program P 0 , which contains ....
....extensions of Negation As Failure, called constructive negation. Examples are intensional negation [3, 4] Chan s constructive negation [6, 7] the fail substitutions [23] and the fail answers [10, 9] techniques. The idea of intensional negation, originally formalized for positive logic programs [3, 4], is the following. Given a normal program P , we derive a new program P 0 , which contains clauses which allow us to compute the answers to negative queries. Example 1.2 Let P be the program even(0) even(s(s(X) even(X) The new clauses in P 0 generated by intensional negation are the ....
[Article contains additional citation context not shown here]
R. Barbuti, P. Mancarella, D. Pedreschi, and F. Turini. Intensional Negation of Logic Programs: Examples and Implementation Techniques. In H. Ehrig, R. Kowalski, G. Levi, and U. Montanari, editors, TAPSOFT '87, volume 250 of Lecture Notes in Computer Science, pages 96--110. Springer-Verlag, Berlin, 1987.
On The Propositional Sldnf-Resolution - Plaza (Correct)
No context found.
R. Barbuti, P. Mancarella, D. Pedreschi and F. Turini, "Intensional Negation of Logic Programs: Examples and Implementation Techniques," proceedings of International Joint Conference on Theory and Practice of Software Development TAPSOFT '87 (Springer Verlag, LNCS 250, 1987) pp. 96-110,
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