Results 1  10
of
758,629
Resolution for MaxSAT
, 2007
"... MaxSAT is the problem of finding an assignment minimizing the number of unsatisfied clauses in a CNF formula. We propose a resolutionlike calculus for MaxSAT and prove its soundness and completeness. We also prove the completeness of some refinements of this calculus. From the completeness proof ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
MaxSAT is the problem of finding an assignment minimizing the number of unsatisfied clauses in a CNF formula. We propose a resolutionlike calculus for MaxSAT and prove its soundness and completeness. We also prove the completeness of some refinements of this calculus. From the completeness proof
On solving the Partial MAXSAT problem
 In International Conference on Theory and Applications of Satisfiability Testing (SAT’06), LNCS 4121
, 2006
"... Abstract. Boolean Satisfiability (SAT) has seen many successful applications in various fields such as Electronic Design Automation and Artificial Intelligence. However, in some cases, it may be required/preferable to use variations of the general SAT problem. In this paper, we consider one importan ..."
Abstract

Cited by 77 (0 self)
 Add to MetaCart
important variation, the Partial MAXSAT problem. Unlike SAT, Partial MAXSAT has certain constraints (clauses) that are marked as relaxable and the rest are hard, i.e. nonrelaxable. The objective is to find a variable assignment that satisfies all nonrelaxable clauses together with the maximum number
Approximation algorithms for MaxSAT
"... The main aim of NPcompleteness theory is the analysis of intractability. Many optimization problems were first proved to be NPhard. Since the complete solution of these problems requires exponential time, polynomial time algorithms to find "nearoptimal" solutions, i.e., approximation al ..."
Abstract
 Add to MetaCart
The main aim of NPcompleteness theory is the analysis of intractability. Many optimization problems were first proved to be NPhard. Since the complete solution of these problems requires exponential time, polynomial time algorithms to find "nearoptimal" solutions, i.e., approximation
2006 and 2007 maxsat evaluations: Contributed instances
 Journal on Satisfiability, Boolean Modeling and Computation
"... In this technical report we briefly describe the instances submitted to the 2006 and 2007 MaxSAT Evaluations. First, we introduce the instances that can be directly encoded as MaxSAT. Then, we describe the methods used to translate problem instances coming from other optimization frameworks to Max ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this technical report we briefly describe the instances submitted to the 2006 and 2007 MaxSAT Evaluations. First, we introduce the instances that can be directly encoded as MaxSAT. Then, we describe the methods used to translate problem instances coming from other optimization frameworks
New inference rules for MaxSAT
 JAIR
, 2007
"... Abstract. Exact MaxSAT 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 MaxSAT problem for the simplified for ..."
Abstract

Cited by 42 (9 self)
 Add to MetaCart
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 MaxSAT instances into equivalent MaxSAT instances which are easier to solve. The soundness of the rules, that can be seen
Exploiting Cycle Structures in MaxSAT
"... Abstract. We investigate the role of cycles structures (i.e., subsets of clauses of the form ¯ l1 ∨ l2, ¯ l1 ∨ l3, ¯ l2 ∨ ¯ l3) in the quality of the lower bound (LB) of modern MaxSAT solvers. Given a cycle structure, we have two options: (i) use the cycle structure just to detect inconsistent su ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
a new solver called MaxSatzc. Our experiments on weighted MaxSAT and Partial MaxSAT instances indicate that MaxSatzc substantially improves MaxSatz on many hard random, crafted and industrial instances. 1
Solving MaxSAT as weighted CSP
, 2003
"... For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We wanted to see how recent progress in the weighted CSP (WCSP) field could compete with other approaches in related fie ..."
Abstract

Cited by 47 (12 self)
 Add to MetaCart
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We wanted to see how recent progress in the weighted CSP (WCSP) field could compete with other approaches in related fields.
Relaxed DPLL search for MaxSAT
 In 12th SAT
, 2009
"... Abstract. We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatisfiability is already computationally difficult. For such instances, our approach is often able to identify a smal ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatisfiability is already computationally difficult. For such instances, our approach is often able to identify a
Toward an instance theory of automatization
 Psychological Review
, 1988
"... This article presents a theory in which automatization is construed as the acquisition of a domainspecific knowledge base, formed of separate representations, instances, of each exposure to the task. Processing is considered automatic if it relies on retrieval of stored instances, which will occur ..."
Abstract

Cited by 613 (37 self)
 Add to MetaCart
This article presents a theory in which automatization is construed as the acquisition of a domainspecific knowledge base, formed of separate representations, instances, of each exposure to the task. Processing is considered automatic if it relies on retrieval of stored instances, which will occur
Applications of MaxSAT in Automotive Configuration
"... We give an introduction to possible applications of MaxSAT solvers in the area of automotive (re)configuration. Where a SAT solver merely produces the answer “unsatisfiable ” when given an inconsistent set of constraints, a MaxSAT solver computes the maximum subset which can be satisfied. Hence, a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We give an introduction to possible applications of MaxSAT solvers in the area of automotive (re)configuration. Where a SAT solver merely produces the answer “unsatisfiable ” when given an inconsistent set of constraints, a MaxSAT solver computes the maximum subset which can be satisfied. Hence, a
Results 1  10
of
758,629