1,721,018 research outputs found
co-LP: Back to the Roots
No full textRecently, several papers dealing with co-inductive logic programming have been proposed, dealing with pure Prolog and constraint logic programming, with and without negation. In this paper we revisit and use, as much as possible, some fundamental results developed in the Eighties to analyze the foundations, and to clarify the possibilities but also the intrinsic theoretical limits of this programming paradigm
Set-Based Constraints
No full textRapporto di Ricerca "Quaderno del Dipartimento di Matematica", n.309, Universita' di Parm
A comparison of CLP(FD) and ASP solutions to NP-complete problems
No full textCLP(FD) and normal logic programs in the context of Answer Set Programming are perhaps the two main declarative approaches to modeling and solving NP-complete problems. In this paper, we compare the encoding style and computational results for the two paradigms, studying some NP-complete problems
A comparison of CLP(FD) and ASP solutions to NP-complete problems
No full textThis paper presents experimental comparisons between declarative
encodings of various computationally hard problems in both Answer
Set Programming (ASP) and Constraint Logic Programming (CLP)
over finite domains. The objective is to identify how the solvers in the two domains respond to different problems, highlighting strengths and weaknesses of their implementations and suggesting criteria for choosing one approach versus the other. Ultimately, the work in this paper is expected to lay the ground for transfer of concepts between the two domains (e.g., suggesting ways to use CLP in the execution of~ASP)
CUD@SAT: GPU parallelism for SAT Solving
No full textEvery new desktop or laptop come equipped with a multicore, programmable graphic processing unit (GPU). The computation power of this kind of unit is fully exploited by some graphical software but GPU is mostly idle during common PC use. Moreover, extra GPUs can be added at a very low price per processor. Such kind of parallelism has been recently exploited by some applications able to split the work into small parallel threads. In this paper we investigate the capabilities of this hardware for search problems, where large threads sometimes need to be delegated to each parallel processors. In particular we deal with the well-known SAT problem and focus on NVIDIA CUDA architecture, one of the most popular platforms for GPU. We experimented several implementing choices and evaluated the results. The most interesting outcome is that with the built-in GPU of a typical office desktop configuration we can reach speed-up of one or even two orders of magnitude
Integrating Finite Domain Constraints and CLP with Sets
No full textIn this paper we propose a semantically well-founded combination of the constraint solvers used in the constraint programming languages CLP(SET) and CLP(FD). This work demonstrates that it is possible to provide efficient executions (through CLP(FD) solvers) while maintaining the expressive power and flexibility of the CLP(SET) language. We develop a combined constraint solver and we show how static analysis can help in organizing the distribution of constraints to the two constraint solvers
- …
