Proceedings Article10.1145/41625.41635
Constraint logic programming
Joxan Jaffar,Jean-Louis Lassez +1 more
- 01 Oct 1987
- pp 111-119
1.7K
TL;DR: In this article, a class of logic programming languages, called CLP languages, are defined, all of which share the same essential semantic properties and are based on a unified formal semantics.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Constraint-based reasoning in deductive databases
Jiawei Han
- 08 Apr 1991
TL;DR: A technique is developed which compiles a functional linear recursion into chain or bounded forms and analyzes efficient processing of the compiled chains based on different kinds of constraints, finding that the principles developed are useful for a large set of deductive database application problems.
26
Constraint contextual rewriting
Alessandro Armando,Silvio Ranise +1 more
- 01 Jan 1998
TL;DR: This paper proposes a generalization of contextual rewriting which allows the available decision procedure to access and manipulate the rewriting context and provides a rule-based presentation of CCR which is modular, declarative, and formal at the same time.
26
Combining constraint solving
Franz Baader,Klaus U. Schulz +1 more
TL;DR: In many areas of Logic, Computer Science, and Artificial Intelligence, there is a need for specialized formalisms and inference mechanisms to solve domain specific tasks and it is necessary to combine these systems both with other specialized systems and with general purpose systems.
26
Optimization and relaxation in constraint logic languages
Kannan Govindarajan,Bharat Jayaraman,Surya Mantha +2 more
- 01 Jan 1996
TL;DR: In this article, preference logic programming (PLP) is extended with facilities to formulate relaxation problems in a natural manner, and the concept of a relaxation goal is introduced, and discussed its use for preference relaxation.
25
A methodology for managing hard constraints in CLP systems
Joxan Jaffar,Spiro Michaylov,Roland H. C. Yap +2 more
- 01 May 1991
TL;DR: A framework is developed for the specification of wakeup degrees which indicate how far a hard constraint is from being awoken, which is then used to specify a runtime structure for the delaying and awakening of hard constraints.
25
References
The Definition and Implementation of a Computer Programming Language Based on Constraints
Jr. Guy L. Steele
- 01 Aug 1980
TL;DR: The goal approached is a complete programming system which will implicitly support the constraint paradigm to the same extent that LISP, say, supports automatic storage management.
288
Book reivew: LOGIC PROGRAMMING: FUNCTIONS, RELATIONS AND EQUATIONS. Edited by Doug DeGroot and Gary Lindstrom (Prentice-Hall)
TL;DR: This is an advanced monograph in Combinatorics dealing with what quite often is called "Hungarian" combinatorics; hypergraphs, set systems, etc.
79
Canonical logic programs
Joxan Jaffar,Peter J. Stuckey +1 more
TL;DR: The main result in this paper proves that this class of programs P is representative of all programs and that for any program P1, there exists a semantically equivalent program P2 which is canonical.
39
•Proceedings Article
Invited Talk: Some Issues and Trends in the Semantics of Logic Programming
Joxan Jaffar,Jean-Louis Lassez,Michael J. Maher +2 more
- 14 Jul 1986
TL;DR: In this article, a user-oriented formalism for the Herbrand universe is proposed, where the objects in this formalism are the uninterpreted terms over the herbrand universe.
29
Some issues and trends in the semantics of logic programming
Joxan Jaffar,Jean-Louis Lassez,Michael J. Maher +2 more
- 01 Sep 1986
TL;DR: This work has seen that the gap between theory and programming practice can be reduced by introducing user-oriented domains into the formalism, and can be achieved without losing the important properties of definite clauses.
28