|
 ABSTRACT
We address the problem of designing programming systems to reason with and about constraints. Taking a logic programming approach, we define a class of programming languages, the CLP languages, all of which share the same essential semantic properties. From a conceptual point of view, CLP programs are highly declarative and are soundly based within a unified framework of formal semantics. This framework not only subsumes that of logic programming, but satisfies the core properties of logic programs more naturally. From a user's point of view, CLP programs have great expressive power due to the constraints which they naturally manipulate. Intuition in the reasoning about programs is enhanced as a result of working directly in the intended domain of discourse. This contrasts with working in the Herbrand Universe wherein every semantic object has to be explicitly coded into a Herbrand term; this enforces reasoning at a primitive level. Finally, from an implementor's point of view, CLP systems can be efficient because of the exploitation of constraint solving techniques over specific domains.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
A. Boming, THINGLAB - A Constraint Orientated Simulation Laboratory, A CM TOPLAS, 3(4), 1981.
|
| |
3
|
A. Colmerauer, Prolog and Infinite Trees, in: Logic Programming, K.L. Clark and S.A. Tarnhmd (Eds.), Academic Press, New York, 1982.
|
| |
4
|
A. Colmerauer, Solving Equations and Inequations on Finite and Infinite Trees, Proc. Conference on Fifth Generation Computer Systems, Tokyo, November 1984.
|
| |
5
|
|
| |
6
|
J. Jaffar and J-L. Lassez, Constraint Logie Programruing, Technical Report, Department of Computer Science, Monash University, June 1986.
|
| |
7
|
N.C. Helntze, J. Jaffar, C.S. Lira, S. Michaylov, P.J. Stuckey, R. Yap and C.N. Yee, The CLP Programmer's Manual, Department of Computer Science, Monash University, June 1986.
|
| |
8
|
J. Jaffar, J-L. Lassez and M.J. Mailer, A Logic Programming Language Scheme, in" Logic Programming: Relations, Functions and ~quations, D. DeGroot, G. Lindstrom (eds.), Prentice Hall, 1986.
|
| |
9
|
J. Jaffar, J-L. Lassez and M.J. Maher, PROLOG-II as an Instance of the Logic Programming Language Scheme, in Formal Descriptions of Programming Concepts, M. Wirsing (Ed), North-HoUand, 1986.
|
| |
10
|
|
| |
11
|
J. Jaffar and S. Michaylov, Methodology and Implementation of a Constraint Logic Programming System, Technical Report, Computer Science Dept., Monash University, June 1986.
|
| |
12
|
|
| |
13
|
|
| |
14
|
J. Jaffar and P.J. Stuckey, A Separation Algorithm for Theories with Uainterpreted Functors, Forthcoming.
|
| |
15
|
|
| |
16
|
|
CITED BY 192
|
|
Nevin Heintze , Joxan Jaffar , Răzvan Voicu, A framework for combining analysis and verification, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.26-39, January 19-21, 2000, Boston, MA, USA
|
|
|
|
|
|
Frank S. de Boer , Maurizio Gabbrielli , Elena Marchiori , Catuscia Palamidessi, Proving concurrent constraint programs correct, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.98-108, January 16-19, 1994, Portland, Oregon, United States
|
|
|
|
|
|
|
|
|
F. Kabanza , J.-M. Stevenne , P. Wolper, Handling infinite temporal data, Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.392-403, April 02-04, 1990, Nashville, Tennessee, United States
|
|
|
Vijay A. Saraswat , Martin Rinard , Prakash Panangaden, The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.333-352, January 21-23, 1991, Orlando, Florida, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
M. Garcia de la Banda , M. Hermenegildo , M. Bruynooghe , V. Dumortier , G. Janssens , W. Simoens, Global analysis of constraint logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.5, p.564-614, Sept. 1996
|
|
|
|
|
|
|
|
|
Roberto Barbuti , Michael Codish , Roberto Giacobazzi , Giorgio Levi, Modelling Prolog control, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.95-104, January 19-22, 1992, Albuquerque, New Mexico, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Paris C. Kanellakis , Sridhar Ramaswamy , Darren E. Vengroff , Jeffrey S. Vitter, Indexing for data models with constraints and classes (extended abstract), Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.233-243, May 25-28, 1993, Washington, D.C., United States
|
|
|
|
|
|
|
|
|
Kannan Govindarajan , Bharat Jayaraman , Surya Mantha, Optimization and relaxation in constraint logic languages, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.91-103, January 21-24, 1996, St. Petersburg Beach, Florida, United States
|
|
|
Eric Monfroy , Michaël Rusinowitch , René Schott, Implementing non-linear constraints with cooperative solvers, Proceedings of the 1996 ACM symposium on Applied Computing, p.63-72, February 17-19, 1996, Philadelphia, Pennsylvania, United States
|
|
|
|
|
|
|
|
|
Brad Vander Zanden , Brad A. Myers , Dario Giuse , Pedro Szekely, The importance of pointer variables in constraint models, Proceedings of the 4th annual ACM symposium on User interface software and technology, p.155-164, November 11-13, 1991, Hilton Head, South Carolina, United States
|
|
|
|
|
|
|
|
|
Dick Hamlet , Bruce Gifford , Borislav Nikolik, Exploring dataflow testing of arrays, Proceedings of the 15th international conference on Software Engineering, p.118-129, May 17-21, 1993, Baltimore, Maryland, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Shin Takahashi , Satoshi Matsuoka , Akinori Yonezawa , Tomihisa Kamada, A general framework for Bi-directional translation between abstract and pictorial data, Proceedings of the 4th annual ACM symposium on User interface software and technology, p.165-174, November 11-13, 1991, Hilton Head, South Carolina, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Marianne Baudinet , Marc Niézette , Pierre Wolper, On the representation of infinite temporal data and queries (extended abstract), Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.280-290, May 29-31, 1991, Denver, Colorado, United States
|
|
|
Paris C. Kanellakis , Gabriel M. Kuper , Peter Z. Revesz, Constraint query languages (preliminary report), Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.299-313, April 02-04, 1990, Nashville, Tennessee, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Kim Marriott , María José García de la Banda , Manuel Hermenegildo, Analyzing logic programs with dynamic scheduling, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.240-253, January 16-19, 1994, Portland, Oregon, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Colin Bell , Anil Nerode , Raymond T. Ng , V. S. Subrahmanian, Implementing deductive databases by linear programming, Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.283-292, June 02-05, 1992, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Alonso Vera , Andrew Howes , Michael McCurdy , Richard L. Lewis, A constraint satisfaction approach to predicting skilled interactive cognition, Proceedings of the SIGCHI conference on Human factors in computing systems, p.121-128, April 24-29, 2004, Vienna, Austria
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Danilo Montesi , Elisa Bertino, Queries, constraints, updates and transactions within a logic-based language, Proceedings of the second international conference on Information and knowledge management, p.500-506, November 01-05, 1993, Washington, D.C., United States
|
|
|
|
|
|
|
|
|
Serge Abiteboul , Peter Buneman , Claude Delobel , Richard Hull , Paris Kanellakis , Victor Vianu, New hope on data models and types: report of an NSF-INRIA workshop, ACM SIGMOD Record, v.19 n.4, p.41-48, Dec. 1990
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Anders Larsson , Erik Larsson , Petru Eles , Zebo Peng, Optimized integration of test compression and sharing for SOC testing, Proceedings of the conference on Design, automation and test in Europe, April 16-20, 2007, Nice, France
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
S. Bistarelli , U. Montanari , F. Rossi , T. Schiex , G. Verfaillie , H. Fargier, Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison, Constraints, v.4 n.3, p.199-240, September 1999
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
S. EstÉvez-martÍn , T. HortalÁ-gonzÁlez , M. RodrÍguez-artalejo , R. Del vado-vÍrseda , F. SÁenz-pÉrez , A. j. FernÁndez, On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp, Theory and Practice of Logic Programming, v.9 n.4, p.415-527, July 2009
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
F.4