Logic Programming with Satisfiability

Details Logic Programming with Satisfiability Logic Programming with Satisfiability

2007-02-13

arxiv.org/abs/cs/0702072v1

Theory and Practice of Logic Programming: 8(1):121-128, 2008

Computer Science

Programming Languages

8 pages, 3 figures, 1 table

Scientific paper

This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic program- ming 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 which we propose here as a logic programming pearl. To illustrate logic programming with SAT solving we give an example Prolog program which solves instances of Partial MAXSAT.

Affiliated with

Also associated with

No associations

Rating

Logic Programming with Satisfiability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Logic Programming with Satisfiability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logic Programming with Satisfiability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-409487