Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Rule-based constraint programming
Fundamenta Informaticae - Special issue on foundations of constraint programming
Building constraint satisfaction problem solvers using rewrite rules and strategies
Fundamenta Informaticae - Special issue on foundations of constraint programming
A proof theoretic view of constraint programming
Fundamenta Informaticae - Special issue on foundations of constraint programming
Implementation of Higher-Order Unification Based on Calculus of Explicit Substitution
SOFSEM '95 Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics
Prototyping Completion with Constraints Using Computational Systems
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Fine-Grained Concurrent Completion
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Selected Papers from Constraint Programming: Basics and Trends
COLETTE, Prototyping CSP Solvers Using a Rule-Based Language
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
Branch and Infer: a Unifying Framework for Integer and Finite Domain Constraint Programming
INFORMS Journal on Computing
Specification of rewriting strategies
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
| Hi-index | 0.00 |
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.