A category-based equational logic semantics to constraint programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1130, Issue , 1996, Pages 200-221

  Diaconescu, Răzvan ^a  

^a INSTITUTE OF MATHEMATICS   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DATA TYPES; COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; LOGIC PROGRAMMING; SEMANTICS; SPECIFICATIONS;

CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT MODEL; CONSTRAINT PROGRAMMING; EQUATIONAL LOGIC; HERBRAND MODEL; LOGICAL SYSTEM;

COMPUTER CIRCUITS;

EID: 84958651830     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61629-2_44     Document Type: Conference Paper

References (27)

1. Franz Baader and Klaus U. Schultz. On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers. Technical Report 94-82, CIS-Universitat Muenchen, 1994.
2. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic paramodulation. Information and Computation, 121(2):172-192, 1995.
3. Garrett Birkhoff. On the structure of abstract algebras. Proceedings of the Cambridge Philosophical Society, 31:433-454, 1935.
4. H.-J. Biirckert. A Resolution Principle for a Logic with Restricted Quantifiers, volume 568 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1991.
5. Alain Colmerauer. An introduction to Prologlll. Technical report, Groupe Intelligence Artificielle, Faculte de Sciences de Luminy.
6. Virgil Cazanescu. Local equational logic. In Zoltan Esik, editor, Proceedings, 9th International Conference on Fundamentals of Computation Theory FCT'93, pages 162-170. Springer-Verlag, 1993. Lecture Notes in Computer Science, Volume 710.
7. Nachum Dershowitz. Computing with rewrite rules. Technical Report ATR-83(8478)-l, The Aerospace Corp., 1983.
8. Razvan Diaconescu. The logic of Horn clauses is equational. Technical Report PRG-TR-3-93, Programming Research Group, University of Oxford, 1990.
9. Razvan Diaconescu. Category-based Semantics for Equational and Constraint Logic Programming. PhD thesis, University of Oxford, 1994.
10. Razvan Diaconescu. Completeness of category-based equational deduction. Mathematical Structures in Computer Science, 5(1):9-41, 1995.
11. Razvan Diaconescu. Constraint institutions for combining solution and constraint domains, 1995. draft.
12. Razvan Diaconescu. Category-based modularisation for equational logic programming. Acta Informatica, 33, 1996. To appear.
13. Razvan Diaconescu. Completeness of semantic paramodulation: a category-based approach. Technical Report IS-RR-96-0006S, Japan Advanced Institute for Science and Technology, 1996.
14. Joseph Goguen. Theorem Proving and Algebra. MIT, to appear 1996.
15. Joseph Goguen and Rod Burstall. Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery, 39(1):95-146, January 1992.
16. Joseph Goguen and Razvan Diaconescu. An Oxford survey of order sorted algebra. Mathematical Structures in Computer Science, 4(4):363-392, 1994.
17. Joseph Goguen and Razvan Diaconescu. An introduction to category-based equational logic. In V.S. Alagar and Maurice Nivat, editors, Algebraic Methodology and Software Technology, volume 936 of Lecture Notes in Computer Science, pages 91-126. Springer, 1995.
18. Joseph Goguen and Jose Meseguer. Completeness of many-sorted equational logic. Houston Journal of Mathematics, 11 (3):307-334, 1985.
19. Joseph Goguen and Jose Meseguer. Models and equality for logical programming. In Hartmut Ehrig, Giorgio Levi, Robert Kowalski, and Ugo Montanari, editors, Proceedings, 1987 TAPSOFT, pages 1-22. Springer, 1987. Lecture Notes in Computer Science, Volume 250.
20. Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Hth ACM Symposium on the Principles of Programming languages, pages 111-119. 1987.
21. Claude Kirchner, Helene Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Revue d'Intelligence Artificielle, 4(3):9-52, 1990. Special issue on Automatic Deduction.
22. Claude Kirchner, Helene Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In P. Van Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming. The Newport Papers., pages 131-158. 1995.
23. Saunders Mac Lane. Categories for the Working Mathematician. Springer, 1971.
24. Jose Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, (93):73-155, 1992.
25. Peter Mosses. Unified algebras and institutions. In Proceedings, Fourth Annual Conference on Logic in Computer Science, pages 304-312. IEEE, 1989.
26. M. Stickel. Automated deduction by theory resolution. Journal of Automated Reasoning, 1(4):333-355, 1985.
27. Alfred Tarski. The semantic conception of truth. Philos. Phenomenological Research, 4:13-47, 1944.