(Enter summary)
Abstract: Current constraint logic programming languages provide simplification
for built-in constraints (e.g., arithmetic or boolean), but do not offer constraint
propagation for user-defined predicates. We present two concepts,
residuation and guarded rules, for obtaining user-defined constraint propagation. (Update)
Context of citations to this paper: More
.... Principle by Haridi and Brand in 1988 [44] It has been independently discovered by Smolka in 1991, who referred to it as residuation [135]. Residuation occured first in the work of At Kaci and Nasr [6] even though there has been no explicit link to search. Similar ideas...
...languages have been given by Maher in [8] who captured guard satisfaction as constraint entailment. Similar in spirit is the work in [14] which considers a logic programming language with don t know choice and guarded rules. In this paper, we give a short, simple and formally...
Cited by: More
J. LOGIC PROGRAMMING 1994:19, 20:1--679 1 Theory and.. - Thom Fruhwirth..
(Correct)
A Language for Experimenting with Declarative - Paradigms Slim Abdennadher
(Correct)
A Calculus for Higher-order Concurrent Constraint Programming.. - Smolka (1994)
(Correct)
Similar documents (at the sentence level):
60.4%: Residuation and Guarded Rules for Constraint Logic Programming - Smolka (1991)
(Correct)
Active bibliography (related documents): More All
0.3: A Flexible Meta-Solver Framework for Constraint Solver.. - Frank, Hofstedt, Mai (2003)
(Correct)
0.3: A Complete and Recursive Feature Theory - Backofen, Smolka (1992)
(Correct)
0.1: Operational Semantics of Constraint Logic Programs with.. - Podelski, Smolka (1995)
(Correct)
Similar documents based on text: More All
0.5: Constraint Logic Programming: A Survey - Jaffar, Maher (1994)
(Correct)
0.4: A Feature Constraint System for Logic Programming with.. - Aït-Kaci, Podelski, Smolka (1992)
(Correct)
0.4: A Simple Operational Model for Concurrent Functional Logic.. - Hanus
(Correct)
Related documents from co-citation: More All
17: Logic semantics for a class of committed-choice programs (context) - Maher - 1987
13: Constraint Logic Programming (context) - Jaffar, Lassez - 1987
12: Kernel Andorra Prolog and its Computation Model
- Haridi, Janson - 1990
BibTeX entry: (Update)
G. Smolka, Residuation and Guarded Rules for Constraint Logic Programming, Digital Equipment Paris Research Laboratory Research Report, France, June 1991. http://citeseer.ist.psu.edu/smolka93residuation.html More
@techreport{ smolka91residuation,
author = "Gert Smolka",
title = "Residuation and Guarded Rules for Constraint Logic Programming",
number = "RR-91-13",
address = "Deutsches Forschungszentrum f{\"u}r K{\"u}nstliche Intelligenz GmbH\\Erwin-Schr{\"o}dinger Stra{ss}e\\Postfach 2080\\67608 Kaiserslautern\\Germany",
pages = "17",
year = "1991",
url = "citeseer.ist.psu.edu/smolka93residuation.html" }
Citations (may not include all citations):
1838
Foundations of Logic Programming (context) - Lloyd - 1984 ACM
759
Negation as failure (context) - Clark - 1978 ACM DBLP
561
Constraint logic programming (context) - Jaffar, Lassez - 1987
267
The constraint logic programming language CHIP (context) - Dincbas, Van Hentenryck et al. - 1988 DBLP
261
An introduction to PROLOG III (context) - Colmerauer - 1990 ACM DBLP
151
Logic semantics for a class of committed-choice programs (context) - Maher - 1987 DBLP
72
Kernel Andorra Prolog and its computation model
- Haridi, Janson - 1990
66
Methodology and implementation of a CLP system (context) - Jaffar, Michaylov - 1987 DBLP
66
ACM Transactions on Programming Languages and Systems (context) - Clark, Gregory et al. - 1986
61
Object oriented programming in Concurrent Prolog (context) - Shapiro, Takeuchi - 1983 ACM DBLP
44
Definite relations over constraint languages
- Hohfeld, Smolka - 1988
19
A logic programming language based on the Andorra model (context) - Haridi - 1990 ACM
19
Technology and Science of Informatics (context) - Colmerauer, Kanoui et al. - 1983
19
The control facilities of IC-PROLOG (context) - Clark, McCabe - 1979
18
Automating control for logic programs (context) - Naish - 1985 ACM DBLP
3
Lisp and Symbolic Computation (context) - Ait-Kaci, Nasr et al. - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ps.uni-sb.de/Papers/abstracts/): More
Set-Based Failure Analysis for Logic Programs and.. - Podelski, Charatonik, .. (1999)
(Correct)
Type Inference for First-Class Messages with Feature Constraints - Müller, Nishimura
(Correct)
Entailment of Non-Structural Subtype Constraints - Niehren, Priesnitz (1999)
(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