See this document in CiteSeerX!

Constructive Negation by Pruning (1995)  (Make Corrections)  (28 citations)
François Fages
Journal of Logic Programming



  Home/Search   Context   Related

Links:   DBLP

 
View or download:
dmi.ens.fr/ftp/pub...iens9524.A4.ps.Z
ens.fr/pub/dmi/use...iens9524.A4.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  dmi.ens.fr/EDITI...Index.liens.95 (more)
From:  fermivista.math.juss...ftp.ens.fr
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper we present a new scheme for constructive negation based on a pruning mechanism over standard SLD-derivation trees, without the need for considering explicitly quantified complex subgoals. The formalism we develop is based on a simple frontier calculus. The resulting execution model is essentially equivalent to the one proposed independently by Drabent for normal logic programs [7]. We argue that this scheme is simple enough to lead to practical implementations as the principle of... (Update)

Context of citations to this paper:   More

.... [13] the set of computed answer constraints [21, 8] finite failures [13] the set of computed constraints with constructive negation [37, 6], etc. For example, computed answer constraints (i.e. final states of computations) can be observed logically: any computed constraint...

...Constructive Negation. Keywords: Constraint Logic Programming, Constructive Negation. 1 Introduction Constructive Negation (CN) [3, 2, 6, 8, 15] is a technique for handling negation in (Constraint) Logic Programming. The technique relies on the explicit construction of answers...

Cited by:   More
A Hierarchy of Semantics for Normal Constraint Logic Programs - Francois Fages And (1996)   (Correct)
Constructive Negation Without Subsidiary Trees - Pasarella, Pino, Orejas   (Correct)
A Necessary Condition for Constructive Negation in.. - Dovier, Pontelli, Rossi (2000)   (Correct)

Similar documents (at the sentence level):
73.7%:   Constructive Negation by Pruning - Fages (1994)   (Correct)
56.5%:   J. Logic Programming 1994:19, 20:1--679 1 Constructive.. - Fran Cois Fages   (Correct)
7.2%:   From Constraint Minimization to Goal Optimization in CLP languages - Fages (1995)   (Correct)

Active bibliography (related documents):   More   All
1.7:   Constructive Negation by Pruning and Optimization Higher-order.. - Fages (1994)   (Correct)
0.2:   Analysis of normal CLP programs - Fages, Gori (1997)   (Correct)
0.2:   Logic Programming with Preferences and Constraints - Jayaraman, Govindarajan, al.   (Correct)

Similar documents based on text:   More   All
0.5:   Concurrent Constraint Programming and Non-Commutative Linear.. - Ruet, Fages (1996)   (Correct)
0.5:   Phase Semantics for Mixed Non-Commutative Classical Linear Logic - Ruet   (Correct)
0.4:   Combining Explicit Negation and Negation by Failure via.. - Fages, Ruet (1994)   (Correct)

Related documents from co-citation:   More   All
19:   Negation in logic programming (context) - Kunen - 1987
16:   Constructive Negation Based on the Completed Database (context) - Chan - 1988
15:   Constructive negation for constraint logic programming (context) - Stuckey - 1995

BibTeX entry:   (Update)

F. Fages. Constructive negation by pruning. J. of Logic Programming, 32(2), 1997. http://citeseer.ist.psu.edu/article/fages95constructive.html   More

@article{ fages97constructive,
    author = "Francois Fages",
    title = "Constructive Negation by Pruning",
    journal = "Journal of Logic Programming",
    volume = "32",
    number = "2",
    pages = "85-118",
    year = "1997",
    url = "citeseer.ist.psu.edu/article/fages95constructive.html" }
Citations (may not include all citations):
1838   Foundations of Logic Programming (context) - Lloyd - 1987  ACM
561   Constraint Logic Programming (context) - Jaffar, Lassez - 1987  ACM   DBLP
435   Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1987  ACM   DBLP
380   Constraint Satisfaction in Logic Programming (context) - Van Hentenryck - 1989  ACM
373   Constraint logic programming: a survey - Jaffar, Maher - 1994  DBLP
344   Concurrent constraint programming (context) - Saraswat - 1993  ACM   DBLP
186   Negation in logic programming (context) - Kunen - 1987
180   Logic programming and negation: a survey - Apt, Bol - 1994  DBLP
128   Declarative modeling of the operational behavior of logic pr.. (context) - Falaschi, Levi et al. - 1989
109   Constructive negation based on the completed database (context) - Chan - 1988  DBLP
77   Constructive negation for constraint logic programming (context) - Stuckey - 1991  DBLP
57   A logic programming view of CLP - Maher - 1993  ACM   DBLP
28   Expanding query power in constraint logic programming langua.. (context) - Maher, Stuckey - 1989  DBLP
15   the semantics of optimization predicates in CLP languages - Fages - 1993
12   Handling preferences in constraint logic programming with re.. - Fages, Fowler et al. - 1994  ACM   DBLP
12   Signed data dependencies in logic programming (context) - Kunen - 1989
10   Semantics of constraint logic programs with optimization - Marriott, Stuckey - 1993  ACM   DBLP
8   The s-semantics approach: theory and applications - Bossi, Gabbrielli et al. - 1994
6   Logic semantics for a class of committed-choice languages (context) - Maher - 1987
5   A Kripke/Kleene semantics for logic programs (context) - Fitting - 1985
5   Constructive negation by pruning and optimization higher-ord.. - Fages - 1995
5   A bottom-up semantics for constructive negation - Bossi, Fabris et al. - 1994
4   What is failure? An approach to constructive negation - Drabent - 1995  DBLP
2   Intensional negation (context) - Bruscoli, Levi et al. - 1993



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.dmi.ens.fr/EDITION/preprints/Index.liens.95.html):   More
The Hilbert Basis of the Cut Cone over the Complete Graph .. - Laburthe, Deza, Laurent (1995)   (Correct)
A Model for Formal Parametric Polymorphism: a Per.. - Abadi, Bellucci, Curien (1995)   (Correct)
Computing Visibility Graphs via Pseudo-triangulations - Pocchiola, Vegter (1995)   (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