Handling relations over finite domains in the rule-based system ELAN

Electronic Notes in Theoretical Computer Science

Volumn 36, Issue , 2000, Pages 194-211

  Ringeissen, Christophe ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; CONSTRAINT THEORY; DATA STRUCTURES; DECODING; FUNCTIONS; MATHEMATICAL MODELS; PROBLEM SOLVING;

ALGEBRAIC STRUCTURES; CONSTRAINT SOLVERS; FINITE ALGEBRAS; TERM REWRITE SYSTEMS (TRS);

LOGIC PROGRAMMING;

EID: 0009923949     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80144-6     Document Type: Conference Paper

References (23)

1. Apt K.R. A Proof Theoretic View of Constraint Programming. Fundamenta Informaticae. 34:1998;295-321
2. Apt K.R., Monfroy E. Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains. Proc. of the 5th International Conference on Principles and Practice of Constraint Programming (CP'99). Lecture Notes in Computer Science. 1713:1999;58-72
3. Borovanský P., Jamoussi, P.-E. Moreau S., Ringeissen C. Handling. ELAN Rewrite Programs via an Exchange Format, in: Proc. of [16]. 1998
4. Borovanský P., Kirchner, H. Kirchner, P.-E. Moreau C., Ringeissen C. An Overview. of ELAN, in: Proc. of [16]. 1998
5. Bryant R.E. Graph-based algorithms for boolean function manipulation. IEEE Transactions on computers. C-35:1986;677-691
6. Büttner W. Implementing complex domains of application in an extended prolog system. International Journal of General Systems. 15:1989;129-139
7. Büttner W., Estenfeld, R. Schmid, H.-A. Schneider K., Tiden E. Symbolic constraint handling through unification in finite algebras. Applicable Algebra in Engineering, Communication and Computation. 1:1990;97-118
8. Büttner W., Simonis H. Embedding boolean expressions into logic programming. Journal of Symbolic Computation. 4:1987;191-205
9. Caseau, Y. and F. Laburthe, CLAIRE: Combining Objects and Rules for Problem Solving, in: Proceedings of the JICSLP'96 Workshop on Multi-Paradigm Logic Programming, TU Berlin, Germany, 1996.
10. Castro C. Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies. Fundamenta Informaticae. 34:1998;263-293
11. Clavel, M., "Reflection in general logics, rewriting logic, and Maude," Ph.D. thesis, University of Navarre, Spain (1998).
12. Clavel M., Duran F., Eker S., Lincoln P., Marti-Oliet N., Meseguer J., Quesada F. Maude as a Metalanguage. Proc. of [16]. 1998
13. Comon H., Dincbas M., Jouannaud J.-P., Kirchner C. A methodological view of constraint solving. Constraints. 4:1999;337-361
14. Deursen A., Heering J., Klint P. "Language Prototyping," World Scientific. 1996;. ISBN 981-02-2732-9
15. Dincbas M., Simonis H., Van Hentenryck P. Extending equation solving and constraint handling in logic programming. Ait-Kaci H., Nivat M. Resolution of Equations in Algebraic Structures. 1989;87-115 Academic Press, San Diego, USA
16. Kirchner C., Kirchner H. "Second Intl. Workshop on Rewriting Logic and its Applications," 1998;Elsevier, Pont-à-Mousson, France
17. Kirchner C., Kirchner H., Vittek M. Designing Constraint Logic Programming Languages using Computational Systems. Van Hentenryck P., Saraswat V. Principles and Practice of Constraint Programming. The Newport Papers. 1995;131-158 MIT Press
18. Kirchner C., Ringeissen C. Rule-Based Constraint Programming. Fundamenta Informaticae. 34:1998;225-262
19. Kirchner H., Ringeissen C. A constraint solver in finite algebras and its combination with unification algorithms. Apt K. Proc. Joint International Conference and Symposium on Logic Programming. 1992;225-239
20. Moreau P., Kirchner H. A compiler for rewrite programs in associative-commutative theories. Palamidessi C., Glaser H., Meinke K. Principles of Declarative Programming, number 1490 in Lecture Notes in Computer Science. 1998;230-249
21. Ringeissen C. "Etude et implantation d'un algorithme d'unification dans les algèbres finies," Rapport de DEA, Université Henri Poincaré - Nancy 1. 1990
22. Ringeissen C., Monfroy E. Generating Propagation Rules for Finite Domains: a Mixed Approach. New Trends in Constraints. Papers from the Joint ERCIM/Compulog-Net Workshop (1999). 2000;Lecture Notes in Artificial Intelligence. To appear.
23. Vittek, M., A Compiler for Nondeterministic Term Rewriting Systems, in: H. Ganzinger, editor, Proceedings 7th Conference on Rewriting Techniques and Applications, New Brunswick (New Jersey, USA), Lecture Notes in Computer Science 1103 (1996), pp. 154-168.