Automated deduction in multiple-valued logics
Automated deduction in multiple-valued logics
Resolution-based theorem proving for many-valued logics
Journal of Symbolic Computation
The SAT problem of signed CNF formulas
Labelled deduction
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Resolution and Path Dissolution in Multi-Valued Logics
ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Capturing Structure with Satisfiability
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics
CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
Minimal and Redundant SAT Encodings for the All-Interval-Series Problem
CCIA '02 Proceedings of the 5th Catalonian Conference on AI: Topics in Artificial Intelligence
Transformations between Signed and Classical Clause Logic
ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
Solving non-Boolean satisfiability problems with stochastic local search
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Search in the patience game ‘Black Hole’
AI Communications - Constraint Programming for Planning and Scheduling
Propagation via lazy clause generation
Constraints
Compact Representation of Sets of Binary Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Sequential Encodings from Max-CSP into Partial Max-SAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Mapping CSP into many-valued SAT
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Variable dependency in local search: prevention Is better than cure
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
On inconsistent clause-subsets for Max-SAT solving
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Towards robust CNF encodings of cardinality constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A complete multi-valued SAT solver
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Parallel search for maximum satisfiability
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
Fundamenta Informaticae
Improving SAT-Based weighted MaxSAT solvers
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Artificial Intelligence
Scarab: a rapid prototyping tool for SAT-based constraint programming systems
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empirically on a set of benchmarks with state-of-the-art SAT solvers. Our results provide empirical evidence that encoding combinatorial problems with the mappings defined here can lead to substantial performance improvements in complete SAT solvers.