Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/the-use-of-a-strategy-language-for-solving-search-problems-ldUmyLOBrf
References (62)
-
(1996)
Logique Par Contraintes -
K. Apt (1998)
A Proof Theoretic View of Constraint ProgrammingFundam. Informaticae, 34
-
Carlos Castro (1998)
Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and StrategiesFundam. Informaticae, 34
-
M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer (1998)
Metalevel computation in Maude -
R. Haralick, G. Elliott (1979)
Increasing Tree Search Efficiency for Constraint Satisfaction Problems -
C. Kirchner, C. Lynch, C. Scharff (1996)
A Fine-Grained Concurrent Completion Procedure -
C. Kirchner, H. Kirchner, M. Vittek (1995)
Principles and Practice of Constraint Programming, The Newport Papers -
Carlos Castro (1998)
COLETTE, Prototyping CSP Solvers Using a Rule-Based Language -
P. Borovanský (1995)
Proceedings of the SOFSEM'95: Theory and Practice of Informatics -
P. Marti, M. Rueher (1995)
A Distributed Cooperating Constraints Solving SystemInt. J. Artif. Intell. Tools, 4
-
T. Frühwirth (1994)
Constraint Programming: Basic and Trends. Selected Papers of the 22nd Spring School in Theoretical Computer Sciences -
P. Borovanský, C. Kirchner, H. Kirchner, Pierre-Etienne Moreau, C. Ringeissen (1998)
An overview of ELAN -
(1997)
Strategies and rewriting in ELAN -
(1992)
Conditional rewriting logic as a unified model of concurrency -
H. Kirchner, P.-E. Moreau (1995)
Proceedings of The 5th Conference on Rewriting Techniques and Applications, Montreal, Canada -
Eugene Freuder, Mark Wallace (2003)
Constraint Satisfaction -
É. Monfroy (1998)
An Environment for Designing/Executing Constraint Solver Collaborations -
A. Bockmayr, T. Kasper (1998)
INFORMS J. Comput. -
C. Castro, E. Monfroy (2000)
Proceedings of The Fifth International Conference on Artificial Intelligence and Symbolic Computation -
C. Kirchner, H. Kirchner, M. Vittek (1995)
ELAN Version 1.17 User Manual -
E. Tsang (1993)
Foundations of constraint satisfaction -
C. Ringeissen (1997)
Proceedings of The 8th Conference on Rewriting Techniques and Applications -
M. Clavel (1998)
Reflection in general logics, rewriting logic, and Maude -
Jianyang Zhou (1997)
Calcul de plus petits produits cartésiens d'intervalles : application au problème d'ordonnancement d'atelier -
Marian Vittek (1994)
Elan : un cadre logique pour le prototypage de langages de programmation avec contraintes -
Alan Mackworth (1977)
Consistency in Networks of RelationsArtif. Intell., 8
-
C. Castro, E. Monfroy (1999)
Proceedings of The Andrei Ershov International Conference, Perspectives of Systems Informatics -
E. Visser, Zine-El-Abidine Benaissa (1998)
A core language for rewriting -
(1997)
Theorem proving using computational systems: The case of the B Predicate prover -
F. Fages (1996)
Programmation Logique Par Contraintes -
H. Beringer, B. Backer (1995)
Combinatorial Problem Solving in Constraint Logic Programming with Cooperating Solvers -
H. Kirchner, Pierre-Etienne Moreau (1996)
A reflective extension of ELAN -
Christopher Welty, Louis Hoebel (2000)
BacktrackingIntell., 11
-
P. Borovanský (1995)
Implementation of Higher-Order Unification Based on Calculus of Explicit Substitution -
54506 Vandoeuvre (1995)
Implementation of Higher-order Uniication Based on Calculus of Explicit Substitution -
Thom Fr (1995)
Constraint Handling Rules ? -
V. Kumar (1992)
Algorithms for constraint-satisfaction problems: A surveyArtif. Intell. Magazine, 13
-
C. Ringeissen (1997)
Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language -
Carlos Castro (1996)
Solving binary CSP using computational systems -
M. Zahn, W. Hower (1996)
Backtracking along with constraint processing and their time complexitiesJ. Exp. Theor. Artif. Intell., 8
-
C. Castro (1998)
Une approche déductive de la résolution de problèmes de satisfaction de contraintes -
P. Borovanský, C. Kirchner, H. Kirchner (1998)
A Functional View of Rewriting and Strategies for a Semantics of ELAN -
P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, M. Vittek (1998)
ELAN Version 3.00 User Manual -
P. Borovanský, Carlos Castro (1998)
Cooperation of constraint solvers: using the new process control facilities of ELAN -
S. Luttik, E. Visser (1997)
Specification of rewriting strategiesCTIT technical reports series
-
C. Kirchner, C. Ringeissen (1998)
Rule-Based Constraint ProgrammingFundam. Informaticae, 34
-
Vipin Kumar (1992)
Algorithms for Constraint-Satisfaction Problems: A SurveyAI Mag., 13
-
É. Monfroy (1996)
Collaboration de solveurs pour la programmation logique à contraintes. (Solver collaboration for constraint logic programming) -
M. Bruynooghe, R. Venken (1992)
Encyclopedia of Artificial Intelligence -
N. Martí-Oliet, J. Meseguer (1996)
Rewriting Logic as a Logical and Semantic FrameworkElectronic Notes in Theoretical Computer Science, 4
-
M. Clavel (1998)
Reflection in general logics, rewriting logic -
É. Monfroy (1998)
The Constraint Solver Collaboration Language of BALI -
(1996)
Introduction to the CLAIRE programming language -
E. Monfroy (1996)
Collaboration de solveurs pour la programmation logique à contraintes -
Peter Borovanský (1998)
Le contrôle de la réécriture : étude et implantation d'un formalisme de stratégies -
H. Kirchner, Pierre-Etienne Moreau (1995)
Prototyping Completion with Constraints Using Computational Systems -
M. Sellink (1997)
Proceedings of the 2nd International Workshop on the Theory and Practice of Algebraic Specifications (ASF+SDF'97) -
Carlos Castro, É. Monfroy (2000)
Basic Operators for Solving Constraints via Collaboration of Solvers -
C. Kirchner, C. Lynch, C. Scharff (1996)
Fine-Grained Concurrent Completion -
J. Meseguer (1996)
Rewriting Logic and its Applications First International Workshop, Asilomar Conference Center, Pacific Grove, California, 3-6 September 1996. Volume 4 Electronic Notes in Theoretical Computer Science. -
P. Borovanský, C. Kirchner, H. Kirchner (1996)
Controlling rewriting by rewriting -
A. Bockmayr, T. Kasper (1998)
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint ProgrammingINFORMS J. Comput., 10
- Publisher
- Springer Journals
- Copyright
- Copyright © 2000 by Kluwer Academic Publishers
- Subject
- Computer Science; Computer Science, general; Artificial Intelligence (incl. Robotics); Mathematics, general; Complexity
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1023/A:1018900617693
- Publisher site
- See Article on Publisher Site
Abstract
The ELAN language implements computational systems, a concept that combines rewriting logic with a description of strategies. It can be used to specify and execute non-deterministic rule-based computation for solving various kinds of search problems. This paper presents several examples illustrating different features of the ELAN strategy language from a simple search problem to solving constrained search problems. Concurrent strategies and ELAN process control facilities are illustrated by prototyping the cooperation of solvers.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 1, 2004