A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
TOY: A System for Experimenting with Cooperation of Constraint Domains
2009
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
[12] , and finite domain constraints [9] . ...
With the aim of increasing the efficiency of goal solving, T OY also provides capabilities for constraint programming, and programs can use constraints within the definitions of both predicates and functions ...
A Constraint Functional Logic Programming Scheme T OY implements a Constraint Functional Logic Programming scheme CF LP (D) over a parametrically given constraint domain D, proposed in [14] . ...
doi:10.1016/j.entcs.2009.12.006
fatcat:dkzbcwoc6re5jklmpcjgisd77e
Constraint Logic Programming
[chapter]
1992
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativity of logic programming with the efficiency of constraint solving. ...
New application areas, amongst them many different classes of combinatorial search problems such as scheduhng, planning or resource allocation can now be solved, which were intractable for logic programming ...
Acknowledgements The authors would like to thank the following people for the discussions they had with them and for their encouragement and support: Abder Aggoun, Nicolas Beldiceanu, Fran~oise Berthier ...
doi:10.1007/3-540-55930-2_2
fatcat:f3kflbw6szewpkpoqsfe2mfneu
A constraint logic programming approach for generating all perfect matchings
2002
Applied Mathematics Letters
Preserved Fulltext
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 application/pdf.
We present a simpler and more elegant approach based on constraint logic programming that embodies the same heuristic. ...
Constraint logic programming (CLP) with finite domains (FD) [5, 6] is an extension of logic programming in which certain variables are restricted to range over a finite set of values (called the domain ...
Constraint logic programming is a paradigm of programming based on a subset of first-order logic and constraints. ...
doi:10.1016/s0893-9659(02)00071-x
fatcat:mzv6c7thpbbz7bcimxiqviczdu
Designing an efficient computation strategy in CFLP(FD) using definitional trees
2005
Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming - WCFLP '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
proposed in [19] for lazy Constraint Functional Logic Programming over a parametrically given constraint domain D. ...
This paper proposes the integration of finite domain (FD) constraints into a general purpose lazy functional logic programming language by means of a concrete instance of the generic scheme CF LP (D), ...
work and for the help in preparing the final version of this paper. ...
doi:10.1145/1085099.1085105
dblp:conf/wcflp/MartinV05
fatcat:zxjgazkdyrhenhtoj3xbfmaqwq
Enhanced Spreadsheet Computing With Finite Domain Constraint Satisfaction
2015
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We present an enhanced spreadsheet system where finite-domain constraint solving is well supported in a visual environment. ...
This paper shows how the spreadsheet computing paradigm is extended to break through this limitation for solving constraint satisfaction problems. ...
All of these extensions essentially provide a spreadsheet interface for constraint (logic) programming or solving domain-specific problems, which require that the defined predicates, constraints, and inference ...
doi:10.5281/zenodo.1209523
fatcat:ov74ebhggbbuxi33zjabo3hpiq
Finite domain and symbolic inference methods for extensions of first-order logic
2011
AI Communications
Preserved Fulltext
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 application/pdf.
In this dissertation, we investigate various sorts of reasoning on finite structures and theories in the logic FO(•), a rich extension of classical logic with, amongst others, inductive definitions and ...
In particular, we study the tasks of constraint propagation, grounding, model revision, and debugging for FO(•). ...
Finite model generators in turn are applied to solve constraint satisfaction problems such as scheduling and planning. ...
doi:10.3233/aic-2010-0474
fatcat:q22d3qujfrc6vdksoz3hoj3rwa
A Comparison of Logic Programming Approaches for Representation and Solving of Constraint Satisfaction Problems
[article]
2000
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Many logic programming based approaches can be used to describe and solve combinatorial search problems. ...
On the one hand there are definite programs and constraint logic programs that compute a solution as an answer substitution to a query containing the variables of the constraint satisfaction problem. ...
We want to thank the members of the DTAI group at K.U.Leuven and anonymous referees for their useful comments. This research is supported by the GOA project LP+. ...
arXiv:cs/0003026v1
fatcat:dmngablzizbxtmdgfih5tpgog4
A Concurrent Operational Semantics for Constraint Functional Logic Programming
2012
International Conference on Logic Programming
Preserved Fulltext
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 application/pdf.
residuation guided by constrained definitional trees, constraint solving, and communication by synchronization on logical variables. ...
In this paper we describe a sound and complete concurrent operational semantics for constraint functional logic programming languages which allows to model declarative applications in which the interaction ...
for concurrent functional and constraint logic programming. ...
doi:10.4230/lipics.iclp.2012.154
dblp:conf/iclp/VirsedaMT12
fatcat:tymooafwuvdmpdprheqiihrk3y
Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison
[article]
2000
arXiv
pre-print
Preserved Fulltext
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 application/pdf.
Many logic programming based approaches can be used to describe and solve combinatorial search problems. ...
On the one hand there is constraint logic programming which computes a solution as an answer substitution to a query containing the variables of the constraint satisfaction problem. ...
Acknowledgements Nikolay Pelov, Emmanuel De Mot and Marc Denecker are supported by the GOA project LP+. ...
arXiv:cs/0011030v1
fatcat:rh44kwqohjairg3pqcdlinygd4
Page 557 of Mathematical Reviews Vol. , Issue 97A
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “Finite domain constraints are one of the most impor- tant constraint domains in constraint logic programming. ...
Logic Programming 27 (1996), no. 3, 185-226.
Summary: “We present the clp(FD) system: a constraint logic programming language with finite domain constraints. ...
A translational approach to constraint answer set solving
2010
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. ...
AbstractWe present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. ...
Acknowledgements NICTA is funded by the Department of Broadband, Communications and the Digital Economy, and the Australian Research Council. ...
doi:10.1017/s1471068410000220
fatcat:gtt2kevvuvfi7knbgmje2fwz7y
A lazy narrowing calculus for declarative constraint programming
2004
Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
The new generic scheme CF LP (D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given constraint domain D. ...
This new calculus is sound and strongly complete w.r.t. the declarative semantics of CF LP (D) programs, which was formalized in [24] by means of a Constraint Rewriting Logic CRW L(D). ...
A constraint solver over a constraint domain D is a function named Solve D expecting as parameters a finite set S ⊆ P Con(D) of atomic primitive constraints (called the constraint store) and a finite set ...
doi:10.1145/1013963.1013972
dblp:conf/ppdp/Lopez-FraguasRV04
fatcat:5m2vii25trckbk5y3wcli33roy
Constraint logic programming for examination timetabling
1996
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Then we describe the examination timetabling problem for our university and show how constraint logic programming over finite domains can be used to solve it efficiently. ...
Our application has been developed using constraint logic programming over finite domains. First, we give a brief overview of OR approaches for solving examination timetabling problems. ...
As stated in [32] , constraint logic programming (CLP) began as a merger of two declarative paradigms: logic programming and constraint solving. ...
doi:10.1016/0743-1066(95)00100-x
fatcat:lfrs5arexzcnpabotn7qm4t2sa
Constraint Logic Programming
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
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 application/pdf.
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 ...
Current CLP engines include technologies and results developed in other communities, which themselves discovered logic as an invaluable tool to model and solve real-life problems. ...
This research has been partially funded by PRIN 2008 project 'Innovative and multi-disciplinary approaches for constraint and preference reasoning'. ...
doi:10.1007/978-3-642-14309-0_4
fatcat:ozoif5tgorhw3mbhnyw3aijpfu
Constraint Logic Programming
[chapter]
2003
Constraint Processing
Preserved Fulltext
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 application/pdf.
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 ...
Current CLP engines include technologies and results developed in other communities, which themselves discovered logic as an invaluable tool to model and solve real-life problems. ...
This research has been partially funded by PRIN 2008 project 'Innovative and multi-disciplinary approaches for constraint and preference reasoning'. ...
doi:10.1016/b978-155860890-0/50016-5
fatcat:mxvb5ji2sjelnb3rn2sxrhq5lm
« Previous
Showing results 1 — 15 out of 55,019 results