18 results on '"Szeider, Stefan"'
Search Results
2. Sum-of-Products with Default Values: Algorithms and Complexity Results.
- Author
-
Ganian, Robert, Eun Jung Kim, Slivovsky, Friedrich, and Szeider, Stefan
- Subjects
ALGORITHMS ,COMPUTER science ,GRAPHICAL modeling (Statistics) ,HYPERGRAPHS ,POLYNOMIALS - Abstract
Weighted Counting for Constraint Satisfaction with Default Values (#CSPD) is a powerful special case of the sum-of-products problem that admits succinct encodings of #CSP, #SAT, and inference in probabilistic graphical models. We investigate #CSPD under the fundamental parameter of incidence treewidth (i.e., the treewidth of the incidence graph of the constraint hypergraph). We show that if the incidence treewidth is bounded, #CSPD can be solved in polynomial time. More specifically, we show that the problem is fixed-parameter tractable for the combined parameter incidence treewidth, domain size, and support size (the maximum number of non-default tuples in a constraint). This generalizes known results on the fixed-parameter tractability of #CSPD under the combined parameter primal treewidth and domain size. We further prove that the problem is not fixed-parameter tractable if any of the three components is dropped from the parameterization. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
3. Solving Problems on Graphs of High Rank-Width.
- Author
-
Eiben, Eduard, Ganian, Robert, and Szeider, Stefan
- Subjects
SUBGRAPHS ,GRAPH theory ,ALGORITHMS - Abstract
A modulator in a graph is a vertex set whose deletion places the considered graph into some specified graph class. The cardinality of a modulator to various graph classes has long been used as a structural parameter which can be exploited to obtain fixed-parameter algorithms for a range of hard problems. Here we investigate what happens when a graph contains a modulator which is large but “well-structured” (in the sense of having bounded rank-width). Can such modulators still be exploited to obtain efficient algorithms? And is it even possible to find such modulators efficiently? We first show that the parameters derived from such well-structured modulators are more powerful for fixed-parameter algorithms than the cardinality of modulators and rank-width itself. Then, we develop a fixed-parameter algorithm for finding such well-structured modulators to every graph class which can be characterized by a finite set of forbidden induced subgraphs. We proceed by showing how well-structured modulators can be used to obtain efficient parameterized algorithms for Minimum Vertex Cover and Maximum Clique. Finally, we use the concept of well-structured modulators to develop an algorithmic meta-theorem for deciding problems expressible in monadic second order logic, and prove that this result is tight in the sense that it cannot be generalized to LinEMSO problems. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
4. Backdoors to q-Horn.
- Author
-
Gaspers, Serge, Ordyniak, Sebastian, Ramanujan, M., Saurabh, Saket, and Szeider, Stefan
- Subjects
POLYNOMIALS ,COMBINATORICS ,ALGORITHMS ,DATA structures ,SATISFIABILITY (Computer science) - Abstract
The class $$\text {q-Horn}$$ , introduced by Boros, Crama and Hammer in 1990, is one of the largest known classes of propositional CNF formulas for which satisfiability can be decided in polynomial time. This class properly contains the fundamental classes of Horn and 2-CNF formulas as well as the class of renamable (or disguised) Horn formulas. In this paper we extend this class so that its favorable algorithmic properties can be made accessible to formulas that are outside but 'close' to this class. We show that deciding satisfiability is fixed-parameter tractable parameterized by the distance of the given formula from $$\text {q-Horn}$$ . The distance is measured by the smallest number of variables that we need to delete from the formula in order to get a $$\text {q-Horn}$$ formula, i.e., the size of a smallest deletion backdoor set into the class $$\text {q-Horn}$$ . This result generalizes known fixed-parameter tractability results for satisfiability decision with respect to the parameters distance from Horn, 2-CNF, and renamable Horn. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
5. Backdoors to Normality for Disjunctive Logic Programs.
- Author
-
FICHTE, JOHANNES K. and SZEIDER, STEFAN
- Subjects
LOGIC programming ,COMPUTER programming ,BOOLEAN matrices ,BOOLEAN algebra ,ALGORITHMS - Abstract
The main reasoning problems for disjunctive logic programs are complete for the second level of the polynomial hierarchy and hence considered harder than the same problems for normal (i.e., disjunction-free) programs, which are on the first level. We propose a new exact method for solving the disjunctive problems which exploits the small distance of a disjunctive programs from being normal. The distance is measured in terms of the size of a smallest "backdoor to normality," which is the smallest number of atoms whose deletion makes the program normal. Our method consists of three phases. In the first phase, a smallest backdoor is computed. We show that this can be done using an efficient algorithm for computing a smallest vertex cover of a graph. In the second phase, the backdoor is used to transform the logic program into a quantified Boolean formula (QBF) where the number of universally quantified variables equals the size of the backdoor and where the total size of the quantified Boolean formula is quasilinear in the size of the given logic program. The quasilinearity is achieved by means of a characterization of the least model of a Horn program in terms of level numberings. In a third phase, the universal variables are eliminated using universal expansion yielding a propositional formula. The blowup in the last phase is confined to a factor that is exponential in the size of the backdoor but linear in the size of the quantified Boolean formula. By checking the satisfiability of the resulting formula with a SAT solver (or by checking the satisfiability of the quantified Boolean formula by a QBF-SAT solver), we can decide the ASP reasoning problems on the input program. In consequence, we have a transformation from ASP problems to propositional satisfiability where the combinatorial explosion, which is expected when transforming a problem from the second level of the polynomial hierarchy to the first level, is confined to a function of the distance to normality of the input program. In terms of parameterized complexity, the transformation is fixed-parameter tractable. We complement this result by showing that (under plausible complexity-theoretic assumptions) such a fixed-parameter tractable transformation is not possible if we consider the distance to tightness instead of distance to normality. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
6. On the Subexponential-Time Complexity of CSP.
- Author
-
de Haan, Ronald, Kanj, Iyad, and Szeider, Stefan
- Subjects
NP-complete problems ,COMPUTATIONAL complexity ,POLYNOMIAL time algorithms ,MATHEMATICS ,ALGORITHMS - Abstract
Not all NP-complete problems share the same practical hardness with respect to exact computation. Whereas some NP-complete problems are amenable to efficient computational methods, others are yet to show any such sign. It becomes a major challenge to develop a theoretical framework that is more fine-grained than the theory of NP-completeness, and that can explain the distinction between the exact complexities of various NP-complete problems. This distinction is highly relevant for constraint satisfaction problems under natural restrictions, where various shades of hardness can be observed in practice. Acknowledging the NP-hardness of such problems, one has to look beyond polynomial time computation. The theory of subexponential-time complexity provides such a framework, and has been enjoying increasing popularity in complexity theory. An instance of the constraint satisfaction problem with n variables over a domain of d values can be solved by brute-force in d
n steps (omitting a polynomial factor). In this paper we study the existence of subexponential-time algorithms, that is, algorithms running in do(n) steps, for various natural restrictions of the constraint satisfaction problem. We consider both the constraint satisfaction problem in which all the constraints are given extensionally as tables, and that in which all the constraints are given intensionally in the form of global constraints. We provide tight characterizations of the subexponential-time complexity of the aforementioned problems with respect to several natural structural parameters, which allows us to draw a detailed landscape of the subexponential-time complexity of the constraint satisfaction problem. Our analysis provides fundamental results indicating whether and when one can significantly improve on the brute-force search approach for solving the constraint satisfaction problem. [ABSTRACT FROM AUTHOR]- Published
- 2015
- Full Text
- View/download PDF
7. Fixed-Parameter Complexity of Minimum Profile Problems.
- Author
-
Bodlaender, Hans L., Langston, Michael A., Gutin, Gregory, Szeider, Stefan, and Yeo, Anders
- Abstract
An ordering of a graph G=(V,E) is a one-to-one mapping α: V →{1,2,...,
V }. The profile of an ordering α of G is prfα(G)=∑v∈V(α(v)- min {α(u): u ∈N[v]}); here N[v] denotes the closed neighborhood of v. The profile prf(G) of G is the minimum of prfα(G) over all orderings α of G. It is well-known that prf(G) equals the minimum number of edges in an interval graph H that contains G as a subgraph. We show by reduction to a problem kernel of linear size that deciding whether the profile of a connected graph G=(V,E) is at most V -1+k is fixed-parameter tractable with respect to the parameter k. Since V -1 is a tight lower bound for the profile of a connected graph G=(V,E), the parameterization above the guaranteed value V -1 is of particular interest. [ABSTRACT FROM AUTHOR] - Published
- 2006
- Full Text
- View/download PDF
8. Tractable answer-set programming with weight constraints: bounded treewidth is not enough.
- Author
-
PICHLER, REINHARD, RÜMMELE, STEFAN, SZEIDER, STEFAN, and WOLTRAN, STEFAN
- Subjects
COMPUTER programming ,PARAMETERIZATION ,COMPUTER software ,PROBLEM solving ,ALGORITHMS ,THEORY of knowledge - Abstract
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks related to programs with cardinality or weight constraints – like checking the consistency of a program – are intractable. Many intractable problems in the area of knowledge representation and reasoning have been shown to become linear time tractable if the treewidth of the programs or formulas under consideration is bounded by some constant. The goal of this paper is to apply the notion of treewidth to programs with cardinality or weight constraints and to identify tractable fragments. It will turn out that the straightforward application of treewidth to such class of programs does not suffice to obtain tractability. However, by imposing further restrictions, tractability can be achieved. [ABSTRACT FROM PUBLISHER]
- Published
- 2014
- Full Text
- View/download PDF
9. Solving MAX- r-SAT Above a Tight Lower Bound.
- Author
-
Alon, Noga, Gutin, Gregory, Kim, Eun, Szeider, Stefan, and Yeo, Anders
- Subjects
KERNEL functions ,ALGORITHMS ,HARMONIC analysis (Mathematics) ,BOOLEAN algebra ,SIMULATED annealing - Abstract
We present an exact algorithm that decides, for every fixed r≥2 in time $O(m)+2^{O(k^{2})}$ whether a given multiset of m clauses of size r admits a truth assignment that satisfies at least ((2−1) m+ k)/2 clauses. Thus Max- r- Sat is fixed-parameter tractable when parameterized by the number of satisfied clauses above the tight lower bound (1−2) m. This solves an open problem of Mahajan et al. (J. Comput. Syst. Sci. 75(2):137-153, ). Our algorithm is based on a polynomial-time data reduction procedure that reduces a problem instance to an equivalent algebraically represented problem with O(9 k) variables. This is done by representing the instance as an appropriate polynomial, and by applying a probabilistic argument combined with some simple tools from Harmonic analysis to show that if the polynomial cannot be reduced to one of size O(9 k), then there is a truth assignment satisfying the required number of clauses. We introduce a new notion of bikernelization from a parameterized problem to another one and apply it to prove that the above-mentioned parameterized Max- r- Sat admits a polynomial-size kernel. Combining another probabilistic argument with tools from graph matching theory and signed graphs, we show that if an instance of Max-2- Sat with m clauses has at least 3 k variables after application of a certain polynomial time reduction rule to it, then there is a truth assignment that satisfies at least (3 m+ k)/4 clauses. We also outline how the fixed-parameter tractability and polynomial-size kernel results on Max- r- Sat can be extended to more general families of Boolean Constraint Satisfaction Problems. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
10. Parameterized Proof Complexity.
- Author
-
Dantchev, Stefan, Martin, Barnaby, and Szeider, Stefan
- Subjects
MATHEMATICAL functions ,COMPUTATIONAL complexity ,MACHINE theory ,MATHEMATICAL analysis ,ALGORITHMS ,COMPUTER science - Abstract
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given propositional formula cannot be satisfied by a truth assignment that sets at most k variables to true, considering k as the parameter (we call such a formula a parameterized contradiction). One could separate the parameterized complexity classes FPT and W[SAT] by showing that there is no fpt-bounded parameterized proof system for parameterized contradictions, i.e., that there is no proof system that admits proofs of size f( k) n where f is a computable function and n represents the size of the propositional formula. By way of a first step, we introduce the system of parameterized tree-like resolution and show that this system is not fpt-bounded. Indeed, we give a general result on the size of shortest tree-like resolution proofs of parameterized contradictions that uniformly encode first-order principles over a universe of size n. We establish a dichotomy theorem that splits the exponential case of Riis's complexity gap theorem into two subcases, one that admits proofs of size f( k) n and one that does not. We also discuss how the set of parameterized contradictions may be embedded into the set of (ordinary) contradictions by the addition of new axioms. When embedded into general (DAG-like) resolution, we demonstrate that the pigeonhole principle has a proof of size 2 n. This contrasts with the case of tree-like resolution where the embedded pigeonhole principle falls into the 'non-FPT' category of our dichotomy. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
11. The parameterized complexity of -flip local search for SAT and MAX SAT.
- Author
-
Szeider, Stefan
- Subjects
COMPUTATIONAL complexity ,MATHEMATICAL variables ,COMBINATORIAL optimization ,ALGORITHMS ,COMPUTATIONAL mathematics ,MATHEMATICAL logic - Abstract
Abstract: Sat and Max Sat are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the number of clauses satisfied by a given truth assignment by flipping the truth values of at most variables (-flip local search). For a total number of variables the size of the search space is of order and grows quickly in ; hence most practical algorithms use 1-flip local search only. In this paper we investigate the worst-case complexity of -flip local search, considering as a parameter: is it possible to search significantly faster than the trivial bound? In addition to the unbounded case we consider instances with a bounded number of literals per clause and instances where each variable occurs in a bounded number of clauses. We also consider the related problem that asks whether we can satisfy all clauses by flipping the truth values of at most variables. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
12. Algorithms for propositional model counting.
- Author
-
Samer, Marko and Szeider, Stefan
- Subjects
ALGORITHMS ,PROPOSITION (Logic) ,MATHEMATICAL decomposition ,GRAPH theory ,COMBINATORICS - Abstract
Abstract: We present algorithms for the propositional model counting problem #SAT. The algorithms utilize tree decompositions of certain graphs associated with the given CNF formula; in particular we consider primal, dual, and incidence graphs. We describe the algorithms coherently for a direct comparison and with sufficient detail for making an actual implementation reasonably easy. We discuss several aspects of the algorithms including worst-case time and space requirements. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF
13. Matched Formulas and Backdoor Sets.
- Author
-
Szeider, Stefan
- Subjects
MATHEMATICAL variables ,ALGORITHMS ,SAT (Educational test) ,GRAPHIC methods ,BOOLEAN searching - Abstract
We demonstrate hardness results for the detection of small backdoor sets with respect to base classes M
r of CNF formulas with maximum deficiency ≤ r (M0 is the class of matched formulas). One of the results applies also to a wide range of base classes with added 'empty clause detection' as recently considered by Dilkina, Gomes, and Sabharwal. We obtain the hardness results in the framework of parameterized complexity, considering the upper bound on the size of smallest backdoor sets as the parameter. Furthermore we compare the generality of the parameters maximum deficiency and the size of a smallest Mr -backdoor set. [ABSTRACT FROM AUTHOR]- Published
- 2010
14. The Linear Arrangement Problem Parameterized Above Guaranteed Value.
- Author
-
Gutin, Gregory, Rafiey, Arash, Szeider, Stefan, and Yeo, Anders
- Subjects
LINEAR statistical models ,LINEAR complementarity problem ,MATHEMATICAL programming ,MATHEMATICAL complexes ,LINEAR dependence (Mathematics) ,GRAPH theory ,MATHEMATICAL optimization ,COMPUTATIONAL complexity ,ALGORITHMS ,COMPUTER science - Abstract
A linear arrangement (LA) is an assignment of distinct integers to the vertices of a graph. The cost of an LA is the sum of lengths of the edges of the graph, where the length of an edge is defined as the absolute value of the difference of the integers assigned to its ends. For many application one hopes to find an LA with small cost. However, it is a classical NP-complete problem to decide whether a given graph G admits an LA of cost bounded by a given integer. Since every edge of G contributes at least one to the cost of any LA, the problem becomes trivially fixed-parameter tractable (FPT) if parameterized by the upper bound of the cost. Fernau asked whether the problem remains FPT if parameterized by the upper bound of the cost minus the number of edges of the given graph; thus whether the problem is FPT "parameterized above guaranteed value." We answer this question positively by deriving an algorithm which decides in time O(m + n + 5.88
k ) whether a given graph with m edges and n vertices admits an LA of cost at most m + k (the algorithm computes such an LA if it exists). Our algorithm is based on a procedure which generates a problem kernel of linear size in linear time for a connected graph G. We also prove that more general parameterized LA problems stated by Serna and Thilikos are not FPT, unless P = NP. [ABSTRACT FROM AUTHOR]- Published
- 2007
- Full Text
- View/download PDF
15. Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
- Author
-
Szeider, Stefan
- Subjects
- *
ALGORITHMS , *MATHEMATICAL formulas , *STATISTICS , *MATHEMATICAL analysis - Abstract
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 withn variables andn+k clauses can be recognized in timenO(k) . We improve this result and present an algorithm with time complexityO(2kn4) ; 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 clausesF , the number of clauses in each of its subsets exceeds the number of variables occurring in the subset at most byk , then we can decide in timeO(2kn3) whetherF is satisfiable;k is called the maximum deficiency ofF 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. [Copyright &y& Elsevier]- Published
- 2004
- Full Text
- View/download PDF
16. New width parameters for SAT and #SAT.
- Author
-
Ganian, Robert and Szeider, Stefan
- Subjects
- *
COMMUNITIES , *ALGORITHMS , *COUNTING - Abstract
We study the parameterized complexity of the propositional satisfiability (SAT) and the more general model counting (#SAT) problems and obtain novel fixed-parameter algorithms that exploit the structural properties of input formulas. In the first part of the paper, we parameterize by the treewidth of the following two graphs associated with CNF formulas: the consensus graph and the conflict graph. Both graphs have as vertices the clauses of the formula; in the consensus graph two clauses are adjacent if they do not contain a complementary pair of literals, while in the conflict graph two clauses are adjacent if they do contain a complementary pair of literals. We show that #SAT is fixed-parameter tractable when parameterized by the treewidth of the former graph, but SAT is W[1]-hard when parameterized by the treewidth of the latter graph. In the second part of the paper, we turn our attention to a novel structural parameter we call h-modularity which is loosely inspired by the well-established notion of community structure. The new parameter is defined in terms of a partition of clauses of the given CNF formula into strongly interconnected communities which are sparsely interconnected with each other. Each community forms a hitting formula, whereas the interconnections between communities form a graph of small treewidth. Our algorithms first identify the community structure and then use them for an efficient solution of SAT and #SAT, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
17. SAT backdoors: Depth beats size.
- Author
-
Dreier, Jan, Ordyniak, Sebastian, and Szeider, Stefan
- Subjects
- *
POLYNOMIAL time algorithms , *SATISFIABILITY (Computer science) , *APPROXIMATION algorithms , *ALGORITHMS - Abstract
For several decades, much effort has been put into identifying classes of CNF formulas whose satisfiability can be decided in polynomial time. Classic results are the linear-time tractability of Horn formulas (Aspvall, Plass, and Tarjan, 1979) and Krom (i.e., 2CNF) formulas (Dowling and Gallier, 1984). Backdoors, introduced by Williams, Gomes and Selman (2003), gradually extend such a tractable class to all formulas of bounded distance to the class. Backdoor size provides a natural but rather crude distance measure between a formula and a tractable class. Backdoor depth, introduced by Mählmann, Siebertz, and Vigny (2021), is a more refined distance measure, which admits the utilization of different backdoor variables in parallel. We propose FPT approximation algorithms to compute backdoor depth into the classes Horn and Krom. This leads to a linear-time algorithm for deciding the satisfiability of formulas of bounded backdoor depth into these classes. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
18. Algorithms and complexity results for persuasive argumentation
- Author
-
Kim, Eun Jung, Ordyniak, Sebastian, and Szeider, Stefan
- Subjects
- *
ALGORITHMS , *MATHEMATICAL models , *ARTIFICIAL intelligence , *REASONING , *LOGICAL prediction , *ABSTRACT thought , *POLYNOMIALS , *GRAPHICAL modeling (Statistics) - Abstract
Abstract: The study of arguments as abstract entities and their interaction as introduced by Dung (1995) has become one of the most active research branches within Artificial Intelligence and Reasoning. A main issue for abstract argumentation systems is the selection of acceptable sets of arguments. Value-based argumentation, as introduced by Bench-Capon (2003) , extends Dungʼs framework. It takes into account the relative strength of arguments with respect to some ranking representing an audience: an argument is subjectively accepted if it is accepted with respect to some audience, it is objectively accepted if it is accepted with respect to all audiences. Deciding whether an argument is subjectively or objectively accepted, respectively, are computationally intractable problems. In fact, the problems remain intractable under structural restrictions that render the main computational problems for non-value-based argumentation systems tractable. In this paper we identify nontrivial classes of value-based argumentation systems for which the acceptance problems are polynomial-time tractable. The classes are defined by means of structural restrictions in terms of the underlying graphical structure of the value-based system. Furthermore we show that the acceptance problems are intractable for two classes of value-based systems that where conjectured to be tractable by Dunne (2007) . [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.