Parallel Satisfiability Solver Based on Hybrid Partitioning Method

2017 ◽  
Author(s):  
Tarek Menouer ◽  
Souheib Baarir
Keyword(s):  
Satisfiability Solver

scholarly journals Logic programming with satisfiability

2007 ◽  
Vol 8 (01) ◽  
pp. 121-128 ◽  
Author(s):  
MICHAEL CODISH ◽  
VITALY LAGOON ◽  
PETER J. STUCKEY
Keyword(s):  
Logic Programming ◽  
The Other ◽  
Sat Solving ◽  
Search Problems ◽  
Prolog Program ◽  
Programming Paradigm ◽  
The One ◽  
Satisfiability Solver

AbstractThis paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming for encoding search problems into satisfiability on the one hand and efficient SAT solving on the other. This synergy between these two exposes a programming paradigm that we propose here as a logic programming pearl. To illustrate logic programming with SAT solving, we give an example Prolog program that solves instances of Partial MAXSAT.

Sign in / Sign up

Export Citation Format

Share Document