Results 1 - 10 of 44,087

The Semantics Of Constraint Logic Programs

by Joxan Jaffar, Michael Maher, Kim Marriott, Peter Stuckey - JOURNAL OF LOGIC PROGRAMMING , 1996
"... This paper presents for the first time the semantic foundations of CLP in a self-contained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract - Cited by 872 (14 self) - Add to MetaCart
and complete proofs for the main lemmas. Importantly, we clarify which theorems depend on conditions such as solution compactness, satisfaction completeness and independence of constraints. Second, we generalize the original results to allow for incompleteness of the constraint solver. This is important

Constraint Logic Programming: A Survey

by Joxan Jaffar, Michael J. Maher
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract - Cited by 869 (25 self) - Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve

Negation and Constraint Logic Programming

by Peter J. Stuckey, Peter J. Stuckey , 1995
"... Almost all constraint logic programming systems include negation, yet nowhere has a sound operational model for negation in CLP been discussed. The SLDNF approach of only allowing ground negative subgoals to execute is very restrictive in constraint logic programming where most variables appearing i ..."
Abstract - Cited by 126 (2 self) - Add to MetaCart
Almost all constraint logic programming systems include negation, yet nowhere has a sound operational model for negation in CLP been discussed. The SLDNF approach of only allowing ground negative subgoals to execute is very restrictive in constraint logic programming where most variables appearing

Memoization in constraint logic programming

by Mark Johnson , 1993
"... This paper shows how to apply memoization (caching of subgoals and associated answer substitutions) in a constraint logic programming setting. The research is is motivated by the desire to ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
This paper shows how to apply memoization (caching of subgoals and associated answer substitutions) in a constraint logic programming setting. The research is is motivated by the desire to

On termination of constraint logic programs

by Livio Colussi, Elena Marchiori, Massimo Marchiori - In Proc. CP'95, LNCS 976 , 1995
"... Abstract. This paper introduces a necessary and sufficient condition for termination of constraint logic programs. The method is based on assigning a dataflow graph to a program, whose nodes are the program points and whose arcs are abstractions of the rules of a transition system, describing the op ..."
Abstract - Cited by 13 (2 self) - Add to MetaCart
Abstract. This paper introduces a necessary and sufficient condition for termination of constraint logic programs. The method is based on assigning a dataflow graph to a program, whose nodes are the program points and whose arcs are abstractions of the rules of a transition system, describing

Coinductive Constraint Logic Programming

by Neda Saeedloei, Gopal Gupta
"... Abstract. Constraint logic programming (CLP) has been proposed as a declarative paradigm for merging constraint solving and logic programming. Recently, coinductive logic programming has been proposed as a powerful extension of logic programming for handling (rational) infinite objects and reasoning ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. Constraint logic programming (CLP) has been proposed as a declarative paradigm for merging constraint solving and logic programming. Recently, coinductive logic programming has been proposed as a powerful extension of logic programming for handling (rational) infinite objects

Constraint Logic Programming

by Marco Gavanelli, Francesca Rossi
"... Abstract. Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently used in many commercial applications. Since the original proposal, it has developed enormously: many languages an ..."
Abstract - Add to MetaCart
Abstract. Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently used in many commercial applications. Since the original proposal, it has developed enormously: many languages

Probabilistic Constraint Logic Programming

by Arbeitspapiere Des, Deutschland Informationssysteme Gmbh, Stefan Riezler, Stefan Riezler , 1997
"... . This paper addresses two central problems for probabilistic processing models: parameter estimation from incomplete data and efficient retrieval of most probable analyses. These questions have been answered satisfactorily only for probabilistic regular and context-free models. We address these pro ..."
Abstract - Add to MetaCart
these problems for a more expressive probabilistic constraint logic programming model. We present a log-linear probability model for probabilistic constraint logic programming. On top of this model we define an algorithm to estimate the parameters and to select the properties of log-linear models from incomplete

Timetabling in Constraint Logic Programming

by Maria Kambi, David Gilbert - In Proc. 9th Symp. on Industrial Applications of PROLOG (INAP'96 , 1996
"... In this paper we describe the timetabling problem and its solvability in a Constraint Logic Programming Language. A solution to the problem has been developed and implemented in ECL i PS e , since it deals with finite domains, it has well-defined interfaces between basic building blocks and supports ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
In this paper we describe the timetabling problem and its solvability in a Constraint Logic Programming Language. A solution to the problem has been developed and implemented in ECL i PS e , since it deals with finite domains, it has well-defined interfaces between basic building blocks

CONSTRAINT LOGIC PROGRAMMING WITH UNCERTAINTY

by Alison Eele (engineering Mathematics
"... This project investigates constraint logic programming and its expansions following the introduction of uncertainty to both domains and constraints. A novel method involving alpha-cuts and dynamic arc constraint networks will be created to handle these forms of uncertainty and the final algorithm wi ..."
Abstract - Add to MetaCart
This project investigates constraint logic programming and its expansions following the introduction of uncertainty to both domains and constraints. A novel method involving alpha-cuts and dynamic arc constraint networks will be created to handle these forms of uncertainty and the final algorithm
Results 1 - 10 of 44,087