Logic programming with satisfiability

Authors:
Michael Codish;Vitaly Lagoon;Peter j. Stuckey
Affiliations:
Department of computer science, ben-gurion university, be'er sheva, israel (email: mcodish@cs.bgu.ac.il);Department of computer science & software engineering, university of melbourne, melbourne, australia (email: vitaly.lagoon@gmail.com);Nicta victoria laboratory and department of computer science & software engineering, university of melbourne, melbourne, australia (email: pjs@csse.unimelb.edu.au)
Venue:
Theory and Practice of Logic Programming
Year:
2008

Citing 6
Cited 18

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
Introduction to algorithms

Introduction to algorithms
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
Local search algorithms for partial MAXSAT

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
SAT solving for argument filterings

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Solving partial order constraints for LPO termination

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Proving Termination with (Boolean) Satisfaction

Logic-Based Program Synthesis and Transformation
Telecommunications Feature Subscription as a Partial Order Constraint Problem

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A declarative encoding of telecommunications feature subscription in SAT

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
A SAT-based approach to size change termination with global ranking functions

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Solving satisfiability problems with preferences

Constraints
Developing approaches for solving a telecommunications feature subscription problem

Journal of Artificial Intelligence Research
Range analysis of microcontroller code using bit-level congruences

FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Pairwise cardinality networks

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Transfer function synthesis without quantifier elimination

ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Boolean lexicographic optimization: algorithms & applications

Annals of Mathematics and Artificial Intelligence
Solving partial order constraints for LPO termination

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
A pearl on SAT solving in prolog

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A pearl on SAT and SMT solving in Prolog

Theoretical Computer Science
Compiling finite domain constraints to sat with bee*

Theory and Practice of Logic Programming
Abstract interpretation of microcontroller code: Intervals meet congruences

Science of Computer Programming
Theory propagation and rational-trees

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems

Journal of Artificial Intelligence Research
Iterative and core-guided MaxSAT solving: A survey and assessment

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

This 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.