A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Dincbas, Constraint satisfaction using constraint logic programming, Artificial Intelligence 58 (1992) 113-159. ... Constraint logic programming (CLP) is a new class of declarative programming languages whose primitive operations are based on constraints (e.g. constraint solving and constraint entailment). ... As a consequence, traditional logic programming languages (e.g. ...doi:10.1016/0004-3702(92)90006-j fatcat:z5qelxv2fbaqlds3nhgsiamqta
The use of Constraint Logic Programming is demonstrated by describing a system developed for scheduling university timetables. ... This paper provides an introduction to Constraint Programming and to Constraint Logic Programming (CLP), an enabler of constraint programming. ... Conclusions This paper has attempted to convey the principles of constraint satisfaction techniques in constraint programming through the description of a constraint logic programming application for timetabling ...doi:10.7166/13-1-314 fatcat:dykjqvsbsfan3ig26sh2tkxirq
“Soon it became clear that constraint satisfaction methods as such are useful and should be provided in the form of com- puter programming languages. An example of such a language is described in G. ... More recently, constraint techniques have been incorpo- rated into logic programming languages, yielding a whole new field of research and application: constraint logic programming (van Hentenryck, 1989 ...
Summary: “In constraint logic programming, unification is re- placed by more general constraint satisfaction. ... In logic programming, this relation- ship can be particularly close, since logic can be used to express both specifications and programs. ...
To solve a tabular constraint satisfaction problem, we program it in Constraint Lingo, then translate the Constraint Lingo program into a program in some lower-level logic formalism such as Prolog. ... Logic programming can be difficult and error-prone because logicprogramming formalisms are too low-level to be used without great effort. ... Acknowledgments We thank Hemantha Ponnuru for his programming and testing support. ...doi:10.1002/spe.623 fatcat:vca6d333krgrtjg5vgdfx4us5q
This paper shows how the spreadsheet computing paradigm is extended to break through this limitation for solving constraint satisfaction problems. ... The new spreadsheet system significantly simplifies the development of many constraint-based applications using a visual tabular interface. ... PrediCalc  is a spreadsheet system which allows general logical constraints for data management systems; logical constraints, constructed using cell names and the usual logical connectives and the ...doi:10.5281/zenodo.1209523 fatcat:ov74ebhggbbuxi33zjabo3hpiq
Lecture Notes in Computer Science
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. ... This paper exploits the point of view of constraint programming as computation in a logical system, namely constraint logic. ... Constraint logic programming merges two declarative programming paradigms: constraint solving and logic programming. ...doi:10.1007/3-540-61629-2_44 fatcat:pmlboic6mrezzjytmu3assogm4
Finite valued constraint satisfaction problems are a formalism for describing many natural optimization problems, where constraints on the values that variables can take come with rational weights and ... dichotomy by showing that all optimization problems in the first class are definable in fixed-point language with counting, while all languages in the second class are not definable, even in infinitary logic ... It states that any constraint language Γ falls into two cases: Either VCSP(Γ) is solvable in polynomial time, using its formulation as a linear program, the so-called basic linear program, or it is NP-hard ...doi:10.4230/lipics.csl.2015.60 dblp:conf/csl/DawarW15 fatcat:izskkefaozeixmho7fgzormshq
The Journal of the Operational Research Society
The Cardinality Operator: A New Logical Connective for Constraint Logic Programming. Technical Report CS-90-24, Brown University. Beldiceanu N and Contejean E (1994). ... Increasing tree search efficiency for constraint satisfaction problems. Artifi Intell 14: 263-313. Nadel BA (1989). Constraint satisfaction algorithms. Comput Intell 5: 188 —224. ...
Lecture Notes in Computer Science
constraint models of constraint logic programs. ... We will define the notion of a constraint model of our constraint logic program and show that stable models of logic programs as well as the supported models of logic programs are just special cases of ... We shall see now how logic programs with logical constraints can be used to get a nice rendering of default logic. ...doi:10.1007/3-540-59487-6_4 fatcat:otfb43mobrdzjaz4dr4kcz5o2q
This paper presents an original approach of safe control synthesis for manufacturing systems controlled by Programmable Logic Controller (PLC) based on the use of a CSP (constraint satisfaction problem ... Abstract: This paper presents an original approach of safe control synthesis for manufacturing systems controlled by Programmable Logic Controller (PLC) based on the use of a CSP (constraint satisfaction ... The proposed methodology to design safe controllers is based on the use of logical safety constraints, which act as logical guards placed at the end of the PLC program, and forbid sending unsafe control ...doi:10.1016/j.ifacol.2016.07.638 fatcat:hj6bepjqczbebg5r7sixrxfib4
Hence it is very easy to switch from logic programming (or more precisely Prolog) to constraint logic programming. The chapter is very clearly written and easy to understand. ... Constraints can naturally by integrated into logic programming where they generalize unification. ...doi:10.1016/j.artint.2005.10.006 fatcat:rtpsnihyo5cwhicxvzb2337rxe
Constraint Logic Programming (CLP), which combines these complementary strengths of the AI and OR approach, is introduced as a new tool to formalize a special class of constraint satisfaction problems ... A case example of constraint satisfaction problems is implemented by MIP and CLP for comparison of the two approaches. ... Like logic programming, CLP uses resolution, but syntactic unification is replaced by constraint satisfaction. ...doi:10.1016/0167-9236(94)00057-3 fatcat:jk7pr2orundndlejbinymr3d3i
In constraint logic programming, unification is replaced by more general constraint satisfaction. ... When the number of nodes reduces to one, these algorithms degenerate to existing centralised constraint satisfaction algorithms such as those used in CLP(R) and CHIP. ... The logic programming machines execute the concurrent logic programs using a distributed unification algorithm (Leung, 1993) . ...doi:10.1006/jsco.1996.0037 fatcat:qfgi3p6clbbuvfqdquog3uncay
Lecture Notes in Computer Science
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. ... We show that when restricted to basic logic programs, this semantics agrees with the conditional-satisfaction based semantics. ... Yi-Dong Shen is supported in part by NSFC grants 60673103, 60721061 and 60833001, and by the National High-tech R&D Program (863 Program). ...doi:10.1007/978-3-642-04238-6_24 fatcat:rewog7vocfez3g4k7vx7xxv5zm
« Previous Showing results 1 — 15 out of 80,684 results