Francois Fages, Julian Fowler, and Thierry Sola. Experiments in reactive constraint logic programming. Journal of Logic Programming, 37(1-3):185--212, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Dynamic Distributed Constraint Satisfaction - Ringwelski, Schlenker (2002) (Correct)
....to a CSP. Dynamic constraint solvers like DJCHR [21] or the system J.CP we are going to describe in this paper do not require state restoration techniques for search and are applicable to solve DynCSPs. These solvers provide a reverse operation to constraint posting, called constraint retraction [22, 10, 7]. With this operation arbitrary non deterministic search algorithms can be implemented that post and retract instantiation constraints [21, 17] The search algorithm posts instantiations to explore the search space and retracts them, if in inconsistency occurred due to their propagation. The ....
F. Fages, J. Fowler, and T. Sola. Experiments in reactive constraint logic programming. Journal of Logic Programming, 37:1-3:185-212, Oct-Dec 1998.
Dynamic Distributed Constraint Satisfaction with.. - Ringwelski, Schlenker (2002) (Correct)
....or to nd all solutions to a CSP. Dynamic constraint solvers like our ACS implementation J.CP [14] or DJCHR [15] do not require state restoration techniques and are still applicable for dynamic problems. These solvers provide a reverse operation to constraint posting, called constraint retraction [16, 8, 7]. Thus arbitrary non deterministic search algorithms can be implemented that post instantiation constraints and reverse this operation, if an inconsistency has been detected [15] During search, dynamic solvers compute states, that would be the current state, if something would not have been done ....
F. Fages, J. Fowler, and T. Sola. Experiments in reactive constraint logic programming. Journal of Logic Programming, 37:1-3:185-212, Oct-Dec 1998.
Towards Reactive Functional Logic Programming Languages - Blanc, Echahed, Serwe (1998) (3 citations) (Correct)
....a change in the current theory occurs (because the change can invalidate the deductions already done) It is obvious that rule (DYN) is a simple approach. Nevertheless, the amount of redundant calculus could probably be limited by a more sophisticated modification of the resolution tree , like in [7]. 4 Conclusion We have presented an extension of functional logic languages which allows to model concrete applications where parallelism and reactivity are necessary. In our approach, we have used the many sorted Horn clause Logic with equality as a means to define abstract data types, ....
....languages (with constraints) can be considered. Several extensions of declarative languages allowing the description of parallel or reactive programs exist in the literature. Our approach is very close to Concurrent Constraint Programming (CCP) 11] and Reactive Constraint Logic Programming (CLP) [7]. CCP integrates ideas from concurrent logic programming and constraint logic programming. Within the CCP framework, it is possible to define processes (agents) communicating via a common store. These processes are defined according to the following grammar A : Success j Fail j ask(c) A j ....
[Article contains additional citation context not shown here]
F. Fages, J. Fowler, and T. Sola. Experiments in reactive constraint logic programming. to appear in The Journal of Logic Programming 1998.
From Chaotic Iteration to Constraint Propagation - Apt (1997) (10 citations) (Correct)
....and a narrowing algorithm, become respectively the instances of our CIIQ algorithm and CII algorithm. The importance of fairness for the study of constraint propagation was noticed in Montanari and 15 Rossi (1991) while the relevance of the chaotic iteration was independently noticed in Fages, Fowler and Sola (1996) and van Emden (1996) In the latter paper the generic chaotic iteration algorithm CII was formulated and proved correct for the domain reduction functions defined in Benhamou and Older (1997) and it was shown that the limit of the constraint propagation process for these functions is their ....
Fages, F., Fowler, J. and Sola, T. (1996). Experiments in reactive constraint logic programming, Technical report, DMI - LIENS CNRS, Ecole Normale Sup'erieure. Submitted for publication.
The Essence of Constraint Propagation - Apt (1998) (48 citations) (Correct)
....to arbitrary t po s and their Cartesian products. In particular, Stabilization Corollary 8 generalizes the main result of this paper. Fairness also plays a prominent role in Montanari and Rossi [24] while the relevance of the chaotic iteration was independently noticed in Fages, Fowler, and Sola [16] and van Emden [28] In the latter paper the generic chaotic iteration algorithm CII was formulated and proved correct for the domain reduction functions defined in Benhamou and Older [6] and it was shown that the limit of the constraint propagation process for these functions is their greatest ....
F. Fages, J. Fowler, and T. Sola. Experiments in reactive constraint logic programming. Technical report, DMI - LIENS CNRS, Ecole Normale Sup'erieure, 1996. To appear in Journal of Logic Programming.
Explanation-Based Repair Techniques for Constraint Programming - Jussien, Debruyne (Correct)
No context found.
Francois Fages, Julian Fowler, and Thierry Sola. Experiments in reactive constraint logic programming. Journal of Logic Programming, 37(1-3):185--212, 1998.
Correctness of Constraint Retraction Algorithms - Debruyne, Ferrand, Jussien.. (2003) (Correct)
No context found.
Francois Fages, Julian Fowler, and Thierry Sola. Experiments in reactive constraint logic programming. Journal of Logic Programming, 37(1-3):185--212, 1998.
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