Edelmira Pasarella, Elvira Pino, Fernando Orejas  Home/Search
Context
Related
| lsi.upc.es/dept/techreps...R0044.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lsi.upc.es/~edelmira/refe...node1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we propose a new operational semantics, called BCN, which is sound and complete with respect to Clark-Kunen's completion for the unrestricted class of Normal Logic Programs. BCN is based on constructive negation and can be seen as an operational semantics for the class of Normal Constraint Logic Programs (NCLP) over the Herbrand universe. The main features of BCN making it a useful operational mechanism are twofold: First, BCN improves the existing proposals because it is... (Update)
Similar documents (at the sentence level):
65.3%: Constructive Negation Without Subsidiary Trees - Pasarella, Pino, Orejas (2000) (Correct)
Active bibliography (related documents): More All
0.3: Modularity in Logic Programming - Pasarella (Correct)
0.2: Tight and Loose Semantics for Transformation Systems - Orejas, Ehrig (Correct)
0.2: Compilative Constructive Negation in Constraint Logic.. - Bruscoli, Levi, Levi, Meo (1994) (Correct)
Similar documents based on text: More All
0.7: An Algebraic Framework For The Definition Of Compositional.. - Lucio, Orejas, Pino (1994) (Correct)
0.6: A Monotonic Declarative Semantics for Normal Logic Programs - Lucio, Orejas, Pino (Correct)
0.5: An algebraic framework for the definition of compositional.. - Lucio, al. (1999) (Correct)
BibTeX entry: (Update)
@misc{ pasarella-constructive,
author = "Edelmira Pasarella and Elvira Pino and Fernando Orejas",
title = "Constructive Negation Without Subsidiary Trees",
url = "citeseer.ist.psu.edu/499686.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
759 Negation as failure (context) - Clark - 1978
373 Constraint logic programming: a survey - Jaffar, Maher - 1994
234 The well-founded semantics for general logic programs - van Gelder, Ross et al. - 1991
186 Negation in logic programming (context) - Kunen - 1987
109 Constructive negation based on the completed database (context) - Chan - 1988
66 Theory and practice of constraint handling rules - Fruhwirth - 1998
34 An approach to constructive negation (context) - Drabent, failure - 1995
34 Information and Computation (context) - Stuckey, constraint - 1995
28 Constructive negation by pruning - Fages - 1997
24 Language and equality theory in logic programming (context) - Shepherdson - 1991
15 A compositional semantics for normal open programs - Etalle, Teusink - 1996
13 The semantics of constraint logic programs - Jaffar, Maher et al. - 1998
8 A complete top-down interpreter for first order programs (context) - Sato, Motoyoshi - 1991
4 An algebraic framework for the definition of compositional s.. - Lucio, Orejas et al. - 1999
Documents on the same site (http://www.lsi.upc.es/~edelmira/references/node1.html):
Constructive Negation Without Subsidiary Trees - Pasarella, Pino, Orejas (2000) (Correct)
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