Filters








398 Hits in 2.6 sec

Tracing and Explaining Execution of CLP(FD) Programs [article]

Magnus Agren, Tamas Szeredi, Nicolas Beldiceanu, Mats Carlsson
2002 arXiv   pre-print
Previous work in the area of tracing CLP(FD) programs mainly focuses on providing information about control of execution and domain modification.  ...  We incorporate explanations in the trace structure, i.e. reasons for why certain solver actions occur.  ...  Instead, we focus on CLP(FD) and in particular the CLP(FD) solver of SICStus Prolog. The idea of tracing constraint programs originates from Meier [9] .  ... 
arXiv:cs/0207047v2 fatcat:75i26ijaivc43l27hkakx2cqga

Multi-valued Action Languages in CLP(FD) [article]

Agostino Dovier, Andrea Formisano, Enrico Pontelli
2009 arXiv   pre-print
To appear in Theory and Practice of Logic Programming (TPLP)  ...  Grants IIS-0812267, HRD-0420407, and CNS-0220590, by the FIRB grant RBNE03B8KK, and by GNCS-Gruppo Nazionale per il Calcolo Scientifico (project Tecniche innovative per la programmazione con vincoli in  ...  (FD): the execution time using the CLP(FD)-based implementation of B.  ... 
arXiv:0912.2846v1 fatcat:mgvmrqz4wzggrntsgx5iuefwk4

Improved Filtering for the Euclidean Traveling Salesperson Problem in CLP(FD)

Alessandro Bertagnon, Marco Gavanelli
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
In order to have a declarative approach, we implemented the filtering algorithms in Constraint Logic Programming on Finite Domains (CLP(FD)).  ...  In this work, we propose to use geometric information, present in Euclidean TSP instances, to improve the filtering power.  ...  Acknowledgments We are deeply indebted with Joachim Schimpf for helping us in the implementation of some of the constraints. This work was partially supported by GNCS-INdAM.  ... 
doi:10.1609/aaai.v34i02.5498 fatcat:4ovul26nozgg5g43f5wdsqu4zm

Optimal placement of valves in a water distribution network with CLP(FD)

MASSIMILIANO CATTAFI, MARCO GAVANELLI, MADDALENA NONATO, STEFANO ALVISI, MARCO FRANCHINI
2011 Theory and Practice of Logic Programming  
AbstractThis paper presents a new application of logic programming to a real-life problem in hydraulic engineering.  ...  Jacobs, Eds.) and show how, thanks to constraint propagation, we can get better solutions than the best solution known in the literature for the Apulian distribution network.  ...  Constraint Logic Programming model We can now show how to model in CLP(FD) the valve placement problem.  ... 
doi:10.1017/s1471068411000275 fatcat:kwger46cqrfglhsz2ytjbdntmi

Design, implementation, and evaluation of the constraint language cc(FD) [chapter]

Pascal Hentenryck, Vijay Saraswat, Yves Deville
1995 Lecture Notes in Computer Science  
The main novelty of cc(FD) is the inclusion of a number of general-purpose combinators, in particular cardinality, constructive disjunction, and blocking implication, in conjunction with new constraint  ...  Results on numerous problems, including scheduling, resource allocation, sequencing, packing, and hamiltonian paths are reported and indicate that cc(FD) comes close to procedural languages on a number  ...  Instead of checking consistency of these constraints, cc(FD) enforces interval consistency.  ... 
doi:10.1007/3-540-59155-9_15 fatcat:3mvo6ay7c5dq3eh2yi5cxsgoai

Design, implementation, and evaluation of the constraint language cc(FD)

Pascal Van Hentenryck, Vijay Saraswat, Yves Deville
1998 The Journal of Logic Programming  
The main novelty of cc(FD) is the inclusion of a number of general-purpose combinators, in particular cardinality, constructive disjunction, and blocking implication, in conjunction with new constraint  ...  Results on numerous problems, including scheduling, resource allocation, sequencing, packing, and hamiltonian paths are reported and indicate that cc(FD) comes close to procedural languages on a number  ...  Instead of checking consistency of these constraints, cc(FD) enforces interval consistency.  ... 
doi:10.1016/s0743-1066(98)10006-7 fatcat:6ziavlffungwzfbcbmkuimk2le

Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)

Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli
2005 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '05  
Globally, we obtain a speed up in the order of 60 w.r.t. [15] .  ...  The paper improves the results presented in [15] and introduces new ideas for improving efficiency: (i) proper reorganization of the constraint structure; (ii) development of novel, both general and problem-specific  ...  ., as an ad-hoc constraint solver, and bypassing the built-in strategies of CLP(FD).  ... 
doi:10.1145/1069774.1069796 dblp:conf/ppdp/PaluDP05 fatcat:f2stxhfbbnallmzjypf7mireaq

A CLP Framework for Computing Structural Test Data [chapter]

Arnaud Gotlieb, Bernard Botella, Michel Rueher
2000 Lecture Notes in Computer Science  
A major challenge of this process consists in generating automatically test data, i.e., in finding input values for which a selected point in a procedure is executed.  ...  We introduce here an original framework where the later problem is transformed into a CLP(FD) problem. Specific operators have been introduced to tackle this kind of application.  ...  Acknowledgements Patrick Taillibert and Serge Varennes gave us invaluable help on the work presented in this paper. Thanks to François Delobel for its comments on an earlier draft of this paper.  ... 
doi:10.1007/3-540-44957-4_27 fatcat:getqxsjienfxtb7hcyzivw5hzm

Constraint Logic Programming [chapter]

Marco Gavanelli, Francesca Rossi
2010 Lecture Notes in Computer Science  
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.  ...  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  ...  Usually, the consistency check is based on some kind of constraint propagation, such as arc-consistency [105] , some weaker version, like bound-consistency [20] , or, more rarely, path-consistency [  ... 
doi:10.1007/978-3-642-14309-0_4 fatcat:ozoif5tgorhw3mbhnyw3aijpfu

Constraint Logic Programming [chapter]

Francesca Rossi
2003 Constraint Processing  
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.  ...  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  ...  Usually, the consistency check is based on some kind of constraint propagation, such as arc-consistency [105] , some weaker version, like bound-consistency [20] , or, more rarely, path-consistency [  ... 
doi:10.1016/b978-155860890-0/50016-5 fatcat:mxvb5ji2sjelnb3rn2sxrhq5lm

A simple and efficient boolean solver for Constraint Logic Programming

Philippe Codognet, Daniel Diaz
1996 Journal of automated reasoning  
We present a boolean CLP language clp(B/FD) built upon a CLP language over finite domains clp(FD) which uses a propagation-based constraint solver.  ...  This clp(B) system provides a further factor two speedup w.r.t. clp(B/FD).  ...  From a design point of view, clp(B) is very similar to clp(FD).  ... 
doi:10.1007/bf00247670 fatcat:whexc6zcq5bmrk4aurz3l3ivgq

Analysing ProB's Constraint Solving Backends [chapter]

Jannik Dunkelau, Joshua Schmidt, Michael Leuschel
2020 Lecture Notes in Computer Science  
The forest is then analysed in regards of feature importances to determine subsets of the B language in which the respective backends excel or lack for performance.  ...  The results are compared to our initial assumptions over each backend's performance in these subsets based on personal experiences.  ...  Subdomains in Which CLP(FD) Presumably Performs Better. First and foremost, the CLP(FD) backend of ProB is the only backend supporting all constructs available in B. It is thus the default backend.  ... 
doi:10.1007/978-3-030-48077-6_8 fatcat:c25osnxxnnboddygwby5fvcize

Applying Constraint Logic Programming to SQL Semantic Analysis

FERNANDO SÁENZ-PÉREZ
2019 Theory and Practice of Logic Programming  
in such queries.  ...  AbstractThis paper proposes the use of Constraint Logic Programming (CLP) to model SQL queries in a data-independent abstract layer by focusing on some semantic properties for signalling possible errors  ...  The equivalent constraints in CLP(Q) and CLP(FD) are respectively clpq:{X Q 1 > X Q 2 }, and X FD 1 #> X FD 2 Example 3. 1 1 Let us consider again the example of gas products presented in the introduction  ... 
doi:10.1017/s1471068419000206 fatcat:jwjr7bqscfcgdjmzg2p5kxsa6u

Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper) [article]

Marco Gavanelli, Maddalena Nonato, Andrea Peano, Davide Bertozzi
2017 arXiv   pre-print
We show how to address such problem in Constraint Logic Programming on Finite Domains (CLP(FD)). This paper is under consideration for possible publication on Theory and Practice of Logic Programming.  ...  One promising trend in digital system integration consists of boosting on-chip communication performance by means of silicon photonics, thus materializing the so-called Optical Networks-on-Chip (ONoCs)  ...  In this paper, we address the same problem in another logic language, namely Constraint Logic Programming on Finite Domains (CLP(FD)), and show that the CLP(FD) formulation is competitive with MILP and  ... 
arXiv:1707.05858v1 fatcat:eobyo4sf7zh3fko7vyaul433hi

Debugging constraint programs [chapter]

Micha Meier
1995 Lecture Notes in Computer Science  
In this paper, we present a paradigm for tracing constraint programs and the design and implementation of Grace, a graphical environment for tracing CLP(FD) programs on top of ECL i PS e . III  ...  The whole area of CP debugging is still lacking both methodology and tools to support users in improving their programs.  ...  Search path. Displays the path in the search space that leads to the solution. For CLP(FD) this is the sequence of labelled variables and their values.Selected data.  ... 
doi:10.1007/3-540-60299-2_13 fatcat:z44jz6kfn5aqhd6drblrwjvroy
« Previous Showing results 1 — 15 out of 398 results