14 research outputs found
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Recognition of minimal unsatisfiable CNF formulas (unsatisfiable CNF formulas which become satisfiable if any clause is removed) is a classical DP-complete problem. It was shown recently that minimal unsatisfiable formulas with n variables and n+k clauses can be recognized in time . We improve this result and present an algorithm with time complexity ; hence the problem turns out to be fixed-parameter tractable (FTP) in the sense of Downey and Fellows (Parameterized Complexity, 1999). Our algorithm gives rise to a fixed-parameter tractable parameterization of the satisfiability problem: If for a given set of clauses F, the number of clauses in each of its subsets exceeds the number of variables occurring in the subset at most by k, then we can decide in time whether F is satisfiable; k is called the maximum deficiency of F and can be efficiently computed by means of graph matching algorithms. Known parameters for fixed-parameter tractable satisfiability decision are tree-width or related to tree-width. Tree-width and maximum deficiency are incomparable in the sense that we can find formulas with constant maximum deficiency and arbitrarily high tree-width, and formulas where the converse prevails
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and its Algorithmic Applications
A pair of unit clauses is called conflicting if it is of the form ,
. A CNF formula is unit-conflict free (UCF) if it contains no pair
of conflicting unit clauses. Lieberherr and Specker (J. ACM 28, 1981) showed
that for each UCF CNF formula with clauses we can simultaneously satisfy at
least \pp m clauses, where \pp =(\sqrt{5}-1)/2. We improve the
Lieberherr-Specker bound by showing that for each UCF CNF formula with
clauses we can find, in polynomial time, a subformula with clauses
such that we can simultaneously satisfy at least \pp m+(1-\pp)m'+(2-3\pp)n"/2
clauses (in ), where is the number of variables in which are not in
.
We consider two parameterized versions of MAX-SAT, where the parameter is the
number of satisfied clauses above the bounds and . The
former bound is tight for general formulas, and the later is tight for UCF
formulas. Mahajan and Raman (J. Algorithms 31, 1999) showed that every instance
of the first parameterized problem can be transformed, in polynomial time, into
an equivalent one with at most variables and clauses. We improve
this to variables and clauses. Mahajan and Raman
conjectured that the second parameterized problem is fixed-parameter tractable
(FPT). We show that the problem is indeed FPT by describing a polynomial-time
algorithm that transforms any problem instance into an equivalent one with at
most variables. Our results are obtained using our improvement
of the Lieberherr-Specker bound above
Optimization Algorithm’s Problems: Comparison Study
Currently, in various fields and disciplines problem optimization are used commonly. In this concern, we have to define solutions which are two known concepts optimal or near optimal optimization problems in regards to some objects. Usually, it is surely difficult to sort problems out in only one step, but some processes can be followed by us which people usually call it problem solving. Frequently, the solution process is split into various steps which are accomplishing one after the other. Therefore, in this paper we consider some algorithms that help us to sort out problems, for exemplify, finding the shortest path, minimum spanning tree, maximum network flows and maximum matching. More importantly, the algorithm comparison will be presented. Additionally, the limitation of each algorithm. The last but not the least, the future research in this area will be approached
On Davis–Putnam reductions for minimally unsatisfiable clause-sets
"Minimally unsatisfiable clause-sets" are fundamental building blocks of satisfiability (SAT) theory. In order to establish a structural theory about them,elimination of certain types of degenerations via "Davis-Putnam (DP) reductions" are essential. These DP-reductions have been used at many placessince more than 50 years, and we now show that we have certain forms of confluence, that is, that the applications of DP-reductions are independent oftheir implementation, to a certain degree
Parameterized Constraint Satisfaction Problems: a Survey
We consider constraint satisfaction problems parameterized above or below guaranteed values. One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses, decide whether there is a truth assignment that satisfies at least m/2 + k clauses, where k is the parameter. Among other problems we deal with are MaxLin2-AA (given a system of linear equations over F_2 in which each equation has a positive integral weight, decide whether there is an assignment to the variables that satisfies equations of total weight at least W/2+k, where W is the total weight of all equations), Max-r-Lin2-AA (the same as MaxLin2-AA, but each equation has at most r variables, where r is a constant) and Max-r-Sat-AA (given a CNF formula F with m clauses in which each clause has at most r literals, decide whether there is a truth assignment satisfying at least sum_{i=1}^m (1-2^{r_i})+k clauses, where k is the parameter, r_i is the number of literals in clause i, and r is a constant). We also consider Max-r-CSP-AA, a natural generalization of both Max-r-Lin2-AA and Max-r-Sat-AA, order (or, permutation) constraint satisfaction problems parameterized above the average value and some other problems related to MaxSat. We discuss results, both polynomial kernels and parameterized algorithms, obtained for the problems mainly in the last few years as well as some open questions
On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem
A workflow specification defines a set of steps and the order in which those
steps must be executed. Security requirements may impose constraints on which
groups of users are permitted to perform subsets of those steps. A workflow
specification is said to be satisfiable if there exists an assignment of users
to workflow steps that satisfies all the constraints. An algorithm for
determining whether such an assignment exists is important, both as a static
analysis tool for workflow specifications, and for the construction of run-time
reference monitors for workflow management systems. Finding such an assignment
is a hard problem in general, but work by Wang and Li in 2010 using the theory
of parameterized complexity suggests that efficient algorithms exist under
reasonable assumptions about workflow specifications. In this paper, we improve
the complexity bounds for the workflow satisfiability problem. We also
generalize and extend the types of constraints that may be defined in a
workflow specification and prove that the satisfiability problem remains
fixed-parameter tractable for such constraints. Finally, we consider
preprocessing for the problem and prove that in an important special case, in
polynomial time, we can reduce the given input into an equivalent one, where
the number of users is at most the number of steps. We also show that no such
reduction exists for two natural extensions of this case, which bounds the
number of users by a polynomial in the number of steps, provided a
widely-accepted complexity-theoretical assumption holds
On Formal Methods for Large-Scale Product Configuration
<p>In product development companies mass customization is widely used to achieve better customer satisfaction while keeping costs down. To efficiently implement mass customization, product platforms are often used. A product platform allows building a wide range of products from a set of predefined components. The process of matching these components to customers' needs is called product configuration. Not all components can be combined with each other due to restrictions of various kinds, for example, geometrical, marketing and legal reasons. Product design engineers develop configuration constraints to describe such restrictions. The number of constraints and the complexity of the relations between them are immense for complex product like a vehicle. Thus, it is both error-prone and time consuming to analyze, author and verify the constraints manually. Software tools based on formal methods can help engineers to avoid making errors when working with configuration constraints, thus design a correct product faster.</p>
<p>This thesis introduces a number of formal methods to help engineers maintain, verify and analyze product configuration constraints. These methods provide automatic verification of constraints and computational support for analyzing and refactoring constraints. The methods also allow verifying the correctness of one specific type of constraints, item usage rules, for sets of mutually-exclusive required items, and automatic verification of equivalence of different formulations of the constraints. The thesis also introduces three methods for efficient enumeration of valid partial configurations, with benchmarking of the methods on an industrial dataset.</p>
<p>Handling large-scale industrial product configuration problems demands high efficiency from the software methods. This thesis investigates a number of search-based and knowledge-compilation-based methods for working with large product configuration instances, including Boolean satisfiability solvers, binary decision diagrams and decomposable negation normal form. This thesis also proposes a novel method based on supervisory control theory for efficient reasoning about product configuration data. The methods were implemented in a tool, to investigate the applicability of the methods for handling large product configuration problems. It was found that search-based Boolean satisfiability solvers with incremental capabilities are well suited for industrial configuration problems.</p>
<p>The methods proposed in this thesis exhibit good performance on practical configuration problems, and have a potential to be implemented in industry to support product design engineers in creating and maintaining configuration constraints, and speed up the development of product platforms and new products.</p
Constraint satisfaction problems in clausal form
This is the report-version of a mini-series of two articles on the
foundations of satisfiability of conjunctive normal forms with non-boolean
variables, to appear in Fundamenta Informaticae, 2011. These two parts are here
bundled in one report, each part yielding a chapter.
Generalised conjunctive normal forms are considered, allowing literals of the
form "variable not-equal value". The first part sets the foundations for the
theory of autarkies, with emphasise on matching autarkies. Main results concern
various polynomial time results in dependency on the deficiency. The second
part considers translations to boolean clause-sets and irredundancy as well as
minimal unsatisfiability. Main results concern classification of minimally
unsatisfiable clause-sets and the relations to the hermitian rank of graphs.
Both parts contain also discussions of many open problems.Comment: 91 pages, to appear in Fundamenta Informaticae, 2011, as Constraint
satisfaction problems in clausal form I: Autarkies and deficiency, Constraint
satisfaction problems in clausal form II: Minimal unsatisfiability and
conflict structur