Digital bio-inspired satisfiability solver leveraging fluctuations

2020 ◽  
Vol 59 (4) ◽  
pp. 040603 ◽  
Author(s):  
Yuko Hara-Azumi ◽  
Naoki Takeuchi ◽  
Kazuaki Hara ◽  
Masashi Aono
2007 ◽  
Vol 8 (01) ◽  
pp. 121-128 ◽  
Author(s):  
MICHAEL CODISH ◽  
VITALY LAGOON ◽  
PETER J. STUCKEY

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