Download:
|
by Razvan Diaconescu
In Magne Haveraaen, Olaf Owe, and Ole-Johan Dahl, editors, Recent Trends in Data Type Specification
ftp://ftp.imar.ro/download/diacon/cstr-lncs.ps.gz
Add To MetaCart
Abstract:
Abstract. This paper exploits the point of view of constraint programming as computation in a logical system, namely constraint logic. We define the basic ingredients of constraint logic, such as constraint models and generalised polynomials. We show that constraint logic is an institution, and we internalise the study of constraint logic to the framework of category-based equational logic. By showing that constraint logic is a special case of category-based equational logic, we integrate the constraint logic programming paradigm into equational logic programming. Results include a Herbrand theorem for constraint logic programming characterising Herbrand models as initial models in constraint logic.
Citations
|
759
|
Constraint Logic Programming
– Jaffar, Lassez
- 1987
|
|
523
|
Categories for the Working Mathematician
– Lane, Saunders
- 1971
|
|
401
|
Institutions: Abstract Model Theory for Specification and Programming
– Goguen, Burnstal
- 1992
|
|
371
|
Conditional rewriting logic as a unified model of concurrency.Theoretical Computer Science
– Meseguer
- 1992
|
|
126
|
On the structure of abstract algebras
– Birkhoff
- 1935
|
|
114
|
Automated deduction by theory resolution
– Stickel
- 1985
|
|
69
|
Basic paramodulation
– Bachmair, Ganzinger, et al.
- 1995
|
|
63
|
Designing constraint logic programming languages using computational systems
– Kirchner, Kirchner, et al.
- 1995
|
|
53
|
Unified algebras and institutions
– Mosses
- 1989
|
|
51
|
Completeness of many-sorted equational logic
– Goguen, Meseguer
- 1985
|
|
38
|
Models and equality for logical programming
– Goguen, Meseguer
- 1987
|
|
35
|
A Resolution Principle for a Logic with Restricted Quantifiers
– Hans-Jurgen, Burckert
- 1991
|
|
33
|
Theorem Proving and Algebra
– Goguen
|
|
32
|
and Razvan Diaconescu. An Oxford survey of order sorted algebra
– Goguen
- 1994
|
|
28
|
On the combination of symbolic constraints, solution domains, and constraint solvers
– Baader, Schulz
- 1995
|
|
28
|
Deduction with symbolic constraints
– Kirchner, Kirchner, et al.
- 1990
|
|
23
|
Category-based Semantics for Equational and Constraint Logic Programming
– Diaconescu
- 1994
|
|
15
|
The logic of Horn clauses is equational
– Diaconescu
- 1993
|
|
10
|
Local equational logic
– Cazanescu
- 1993
|
|
7
|
Computing with rewrite rules
– Dershowitz
- 1983
|
|
5
|
Category-based modularisation for equational logic programming
– Diaconescu
- 1996
|
|
4
|
Completeness of semantic paramodulation: a category-based approach
– Diaconescu
- 1996
|
|
2
|
An introduction to PrologIII. Technical report, Groupe Intelligence Artificielle, Faculte de Sciences de Luminy
– Colmerauer
|
|
2
|
The semantic conception of truth. Philos
– Tarski
- 1944
|
|
1
|
Completeness of category-based equational deduction. Mathematical Structures in Computer Science, 5(1):9--41
– Diaconescu
- 1995
|
|
1
|
Constraint institutions for combining solution and constraint domains
– Diaconescu
- 1995
|
