Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Maintaining reversible DAC for Max-CSP
Artificial Intelligence
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A constraint-based approach to narrow search trees for satisfiability
Information Processing Letters
New upper bounds for maximum satisfiability
Journal of Algorithms
A machine program for theorem-proving
Communications of the ACM
Faster exact algorithms for hard problems: a parameterized point of view
Discrete Mathematics
Introduction to Algorithms
Partition-Based Lower Bound for Max-CSP
Constraints
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
New Lower Bounds of Constraint Violations for Over-Constrained Problems
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Directed Arc Consistency Preprocessing
Constraint Processing, Selected Papers
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Discrete Applied Mathematics
Reduction operations in fuzzy or valued constraint satisfaction
Fuzzy Sets and Systems - Optimisation and decision
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Arc consistency for soft constraints
Artificial Intelligence
MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Improving exact algorithms for MAX-2-SAT
Annals of Mathematics and Artificial Intelligence
Exact Max-SAT solvers for over-constrained problems
Journal of Heuristics
Many hard examples in exact phase transitions
Theoretical Computer Science
Artificial Intelligence
A logical approach to efficient Max-SAT solving
Artificial Intelligence
Study of lower bound functions for MAX-2-SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
New inference rules for efficient Max-SAT solving
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Inference rules for high-order consistency in weighted CSP
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Understanding the power of clause learning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Existential arc consistency: getting closer to full arc consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Resolution in Max-SAT and its relation to local consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A simple model to generate hard satisfiable instances
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Partial max-SAT solvers with clause learning
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Solving over-constrained problems with SAT technology
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Improved exact solvers for weighted Max-SAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A complete calculus for Max-SAT
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A logical approach to efficient Max-SAT solving
Artificial Intelligence
Algorithms for maximum satisfiability using unsatisfiable cores
Proceedings of the conference on Design, automation and test in Europe
Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A new Approach for Solving Satisfiability Problems with Qualitative Preferences
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Relaxed DPLL Search for MaxSAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Exploiting Cycle Structures in Max-SAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Algorithms for Weighted Boolean Optimization
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Within-problem learning for efficient lower bound computation in Max-SAT solving
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
MINIMAXSAT: an efficient weighted max-SAT solver
Journal of Artificial Intelligence Research
Integrating systematic and local search paradigms: a new strategy for MaxSAT
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On inconsistent clause-subsets for Max-SAT solving
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Clone: solving weighted Max-SAT in a reduced search space
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Modelling Max-CSP as partial Max-SAT
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A preprocessor for Max-SAT solvers
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A Max-SAT inference-based pre-processing for Max-clique
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Towards more effective unsatisfiability-based maximum satisfiability algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Resolution-based lower bounds in MaxSAT
Constraints
Solving satisfiability problems with preferences
Constraints
A new upper bound for Max-2-SAT: A graph-theoretic approach
Journal of Discrete Algorithms
Using learnt clauses in MAXSAT
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Max-SAT formalisms with hard and soft constraints
AI Communications
Journal of Automated Reasoning
Semiring-induced propositional logic: definition and basic algorithms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Cause clue clauses: error localization using maximum satisfiability
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Towards computing revised models for FO theories
INAP'09 Proceedings of the 18th international conference on Applications of declarative programming and knowledge management
Learning action models for multi-agent planning
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Boolean lexicographic optimization: algorithms & applications
Annals of Mathematics and Artificial Intelligence
Improving unsatisfiability-based algorithms for boolean optimization
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Dynamic SAT with decision change costs: formalization and solutions
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Read-once resolution for unsatisfiability-based Max-SAT algorithms
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Minimum satisfiability and its applications
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Parallel search for maximum satisfiability
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Optimizing with minimum satisfiability
Artificial Intelligence
Improvements to core-guided binary search for MaxSAT
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
A new encoding from MinSAT into MaxSAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
NuMVC: an efficient local search algorithm for minimum vertex cover
Journal of Artificial Intelligence Research
A modular approach to MaxSAT modulo theories
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Action-model acquisition from noisy plan traces
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Refining incomplete planning domain models through plan traces
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A SAT-based approach to cost-sensitive temporally expressive planning
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
Hi-index | 0.00 |
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simplified formula that preserves satisfiability but, unfortunately, solving the Max-SAT problem for the simplified formula is not equivalent to solving it for the original formula. In this paper, we define a number of original inference rules that, besides being applied efficiently, transform Max-SAT instances into equivalent Max-SAT instances which are easier to solve. The soundness of the rules, that can be seen as refinements of unit resolution adapted to Max-SAT, are proved in a novel and simple way via an integer programming transformation. With the aim of finding out how powerful the inference rules are in practice, we have developed a new Max-SAT solver, called MaxSatz, which incorporates those rules, and performed an experimental investigation. The results provide empirical evidence that MaxSatz is very competitive, at least, on random Max-2SAT, random Max-3SAT, Max-Cut, and Graph 3-coloring instances, as well as on the benchmarks from the Max-SAT Evaluation 2006.