449 research outputs found
Tree Projections and Constraint Optimization Problems: Fixed-Parameter Tractability and Parallel Algorithms
Tree projections provide a unifying framework to deal with most structural
decomposition methods of constraint satisfaction problems (CSPs). Within this
framework, a CSP instance is decomposed into a number of sub-problems, called
views, whose solutions are either already available or can be computed
efficiently. The goal is to arrange portions of these views in a tree-like
structure, called tree projection, which determines an efficiently solvable CSP
instance equivalent to the original one. Deciding whether a tree projection
exists is NP-hard. Solution methods have therefore been proposed in the
literature that do not require a tree projection to be given, and that either
correctly decide whether the given CSP instance is satisfiable, or return that
a tree projection actually does not exist. These approaches had not been
generalized so far on CSP extensions for optimization problems, where the goal
is to compute a solution of maximum value/minimum cost. The paper fills the
gap, by exhibiting a fixed-parameter polynomial-time algorithm that either
disproves the existence of tree projections or computes an optimal solution,
with the parameter being the size of the expression of the objective function
to be optimized over all possible solutions (and not the size of the whole
constraint formula, used in related works). Tractability results are also
established for the problem of returning the best K solutions. Finally,
parallel algorithms for such optimization problems are proposed and analyzed.
Given that the classes of acyclic hypergraphs, hypergraphs of bounded
treewidth, and hypergraphs of bounded generalized hypertree width are all
covered as special cases of the tree projection framework, the results in this
paper directly apply to these classes. These classes are extensively considered
in the CSP setting, as well as in conjunctive database query evaluation and
optimization
Computing the eigenvalues of symmetric H2-matrices by slicing the spectrum
The computation of eigenvalues of large-scale matrices arising from finite
element discretizations has gained significant interest in the last decade.
Here we present a new algorithm based on slicing the spectrum that takes
advantage of the rank structure of resolvent matrices in order to compute m
eigenvalues of the generalized symmetric eigenvalue problem in operations, where is a small constant
Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining five classes of variable orders more and more dynamic which preserve the time complexity bound. For that, we define extensions of this theoretical time complexity bound to increase the dynamic aspect of these orders. We define a constant k allowing us to extend the classical bound from O(exp(w + 1)) firstly to O(exp(w + k + 1)), and finally to O(exp(2(w + k+1)−s −)), with w the ”tree-width ” of a CSP and s − the minimum size of its separators. Finally, we assess the defined theoretical extension of the time complexity bound from a practical viewpoint
Tree Projections and Structural Decomposition Methods: Minimality and Game-Theoretic Characterization
Tree projections provide a mathematical framework that encompasses all the
various (purely) structural decomposition methods that have been proposed in
the literature to single out classes of nearly-acyclic (hyper)graphs, such as
the tree decomposition method, which is the most powerful decomposition method
on graphs, and the (generalized) hypertree decomposition method, which is its
natural counterpart on arbitrary hypergraphs. The paper analyzes this
framework, by focusing in particular on "minimal" tree projections, that is, on
tree projections without useless redundancies. First, it is shown that minimal
tree projections enjoy a number of properties that are usually required for
normal form decompositions in various structural decomposition methods. In
particular, they enjoy the same kind of connection properties as (minimal) tree
decompositions of graphs, with the result being tight in the light of the
negative answer that is provided to the open question about whether they enjoy
a slightly stronger notion of connection property, defined to speed-up the
computation of hypertree decompositions. Second, it is shown that tree
projections admit a natural game-theoretic characterization in terms of the
Captain and Robber game. In this game, as for the Robber and Cops game
characterizing tree decompositions, the existence of winning strategies implies
the existence of monotone ones. As a special case, the Captain and Robber game
can be used to characterize the generalized hypertree decomposition method,
where such a game-theoretic characterization was missing and asked for. Besides
their theoretical interest, these results have immediate algorithmic
applications both for the general setting and for structural decomposition
methods that can be recast in terms of tree projections
On Sparse Discretization for Graphical Games
This short paper concerns discretization schemes for representing and
computing approximate Nash equilibria, with emphasis on graphical games, but
briefly touching on normal-form and poly-matrix games. The main technical
contribution is a representation theorem that informally states that to account
for every exact Nash equilibrium using a nearby approximate Nash equilibrium on
a grid over mixed strategies, a uniform discretization size linear on the
inverse of the approximation quality and natural game-representation parameters
suffices. For graphical games, under natural conditions, the discretization is
logarithmic in the game-representation size, a substantial improvement over the
linear dependency previously required. The paper has five other objectives: (1)
given the venue, to highlight the important, but often ignored, role that work
on constraint networks in AI has in simplifying the derivation and analysis of
algorithms for computing approximate Nash equilibria; (2) to summarize the
state-of-the-art on computing approximate Nash equilibria, with emphasis on
relevance to graphical games; (3) to help clarify the distinction between
sparse-discretization and sparse-support techniques; (4) to illustrate and
advocate for the deliberate mathematical simplicity of the formal proof of the
representation theorem; and (5) to list and discuss important open problems,
emphasizing graphical-game generalizations, which the AI community is most
suitable to solve.Comment: 30 pages. Original research note drafted in Dec. 2002 and posted
online Spring'03 (http://www.cis.upenn.
edu/~mkearns/teaching/cgt/revised_approx_bnd.pdf) as part of a course on
computational game theory taught by Prof. Michael Kearns at the University of
Pennsylvania; First major revision sent to WINE'10; Current version sent to
JAIR on April 25, 201
Exploiting chordal structure in polynomial ideals: a Gr\"obner bases approach
Chordal structure and bounded treewidth allow for efficient computation in
numerical linear algebra, graphical models, constraint satisfaction and many
other areas. In this paper, we begin the study of how to exploit chordal
structure in computational algebraic geometry, and in particular, for solving
polynomial systems. The structure of a system of polynomial equations can be
described in terms of a graph. By carefully exploiting the properties of this
graph (in particular, its chordal completions), more efficient algorithms can
be developed. To this end, we develop a new technique, which we refer to as
chordal elimination, that relies on elimination theory and Gr\"obner bases. By
maintaining graph structure throughout the process, chordal elimination can
outperform standard Gr\"obner basis algorithms in many cases. The reason is
that all computations are done on "smaller" rings, of size equal to the
treewidth of the graph. In particular, for a restricted class of ideals, the
computational complexity is linear in the number of variables. Chordal
structure arises in many relevant applications. We demonstrate the suitability
of our methods in examples from graph colorings, cryptography, sensor
localization and differential equations.Comment: 40 pages, 5 figure
Symmetry Breaking for Answer Set Programming
In the context of answer set programming, this work investigates symmetry
detection and symmetry breaking to eliminate symmetric parts of the search
space and, thereby, simplify the solution process. We contribute a reduction of
symmetry detection to a graph automorphism problem which allows to extract
symmetries of a logic program from the symmetries of the constructed coloured
graph. We also propose an encoding of symmetry-breaking constraints in terms of
permutation cycles and use only generators in this process which implicitly
represent symmetries and always with exponential compression. These ideas are
formulated as preprocessing and implemented in a completely automated flow that
first detects symmetries from a given answer set program, adds
symmetry-breaking constraints, and can be applied to any existing answer set
solver. We demonstrate computational impact on benchmarks versus direct
application of the solver.
Furthermore, we explore symmetry breaking for answer set programming in two
domains: first, constraint answer set programming as a novel approach to
represent and solve constraint satisfaction problems, and second, distributed
nonmonotonic multi-context systems. In particular, we formulate a
translation-based approach to constraint answer set solving which allows for
the application of our symmetry detection and symmetry breaking methods. To
compare their performance with a-priori symmetry breaking techniques, we also
contribute a decomposition of the global value precedence constraint that
enforces domain consistency on the original constraint via the unit-propagation
of an answer set solver. We evaluate both options in an empirical analysis. In
the context of distributed nonmonotonic multi-context system, we develop an
algorithm for distributed symmetry detection and also carry over
symmetry-breaking constraints for distributed answer set programming.Comment: Diploma thesis. Vienna University of Technology, August 201
- …