[HTML][HTML] Design and results of the fifth answer set programming competition
Abstract Answer Set Programming (ASP) is a well-established paradigm of declarative
programming that has been developed in the field of logic programming and non-monotonic …
programming that has been developed in the field of logic programming and non-monotonic …
Optimal personalised treatment computation through in silico clinical trials on patient digital twins
Abstract In Silico Clinical Trials (ISCT), ie clinical experimental campaigns carried out by
means of computer simulations, hold the promise to decrease time and cost for the safety …
means of computer simulations, hold the promise to decrease time and cost for the safety …
Compiling finite domain constraints to SAT with BEE
We present BEE, a compiler which enables to encode finite domain constraint problems to
CNF. Using BEE both eases the encoding process for the user and also performs …
CNF. Using BEE both eases the encoding process for the user and also performs …
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
We present an approach to propagation-based SAT encoding of combinatorial problems,
Boolean equi-propagation, where constraints are modeled as Boolean functions which …
Boolean equi-propagation, where constraints are modeled as Boolean functions which …
A novel constraint programming model for large-scale scheduling problems in multiproduct multistage batch plants: Limited resources and campaign-based operation
This contribution introduces an efficient constraint programming (CP) model that copes with
large-scale scheduling problems in multiproduct multistage batch plants. It addresses …
large-scale scheduling problems in multiproduct multistage batch plants. It addresses …
[PDF][PDF] Grid based propositional satisfiability solving
AEJ Hyvärinen - 2011 - aaltodoc.aalto.fi
This work studies how grid and cloud computing can be applied to efficiently solving
propositional satisfiability problem (SAT) instances. Propositional logic provides a …
propositional satisfiability problem (SAT) instances. Propositional logic provides a …
URSA: a system for uniform reduction to SAT
P Janicic - Logical Methods in Computer Science, 2012 - lmcs.episciences.org
There are a huge number of problems, from various areas, being solved by reducing them to
SAT. However, for many applications, translation into SAT is performed by specialized …
SAT. However, for many applications, translation into SAT is performed by specialized …
Optimal placement of valves in a water distribution network with CLP (FD)
This paper presents a new application of logic programming to a real-life problem in
hydraulic engineering. The work is developed as a collaboration of computer scientists and …
hydraulic engineering. The work is developed as a collaboration of computer scientists and …
MILP, pseudo-boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks
MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay
Nodes in Mission Critical Wireless Networks Page 1 Fundamenta Informaticae 174 (2020) …
Nodes in Mission Critical Wireless Networks Page 1 Fundamenta Informaticae 174 (2020) …
Constraint logic programming
M Gavanelli, F Rossi - A 25-Year Perspective on Logic Programming …, 2010 - Springer
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 …
Logic Programming; it attracts the interest of theoreticians and practitioners, and it is …