CAMA: A Multi-Valued Satisfiability Solver

Authors:
Cong Liu;Andreas Kuehlmann;Matthew W. Moskewicz
Affiliations:
University of California at Berkeley;University of California at Berkeley/ Cadence Berkeley Labs, CA;University of California at Berkeley
Venue:
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Year:
2003

Citing 11
Cited 9

Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Improvements to propositional satisfiability search algorithms

Improvements to propositional satisfiability search algorithms
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Multi-Valued Logic Synthesis

VLSID '99 Proceedings of the 12th International Conference on VLSI Design - 'VLSI for the Information Appliance'
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe
Solving non-Boolean satisfiability problems with stochastic local search

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Combinational test generation using satisfiability

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

An efficient finite-domain constraint solver for circuits

Proceedings of the 41st annual Design Automation Conference
Efficient Conflict-Based Learning in an RTL Circuit Constraint Solver

Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Algorithms for maximum satisfiability using unsatisfiable cores

Proceedings of the conference on Design, automation and test in Europe
Bounded Model Checking for Partial Kripke Structures

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
A Multivalued logic model of planning

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A multivalued planning model

International Journal of Artificial Intelligence and Soft Computing
A complete multi-valued SAT solver

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Determination of α-resolution in lattice-valued first-order logic LF(X)

Information Sciences: an International Journal
Resolution procedures for multiple-valued optimization

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the multi-valued SAT solver CAMA. CAMAgeneralizes the recently developed speed-up techniques usedin state-of-the-art binary SAT solvers, such as the two-literal-watching scheme for Boolean constraint propagation (BCP), conflict-based learning with identifying the first unique implication point (UIP), and non-chronological back-tracking. In addition, a novel minimum value set (MVS) technique is introduced for improving the efficiency of conflict-based learning. By analyzing the conflict clauses, MVS can potentially prune conflictingspace that has not been searched before. Two different decisionheuristics are discussed and evaluated. Finally the performanceof CAMA is compared with Chaff using on a one-hot-encodingscheme. The experimental results show that, for MV-SAT problemswith large variable domains, CAMA outperforms Chaff.