4,410 research outputs found
The Power of Linear Programming for Valued CSPs
A class of valued constraint satisfaction problems (VCSPs) is characterised
by a valued constraint language, a fixed set of cost functions on a finite
domain. An instance of the problem is specified by a sum of cost functions from
the language with the goal to minimise the sum. This framework includes and
generalises well-studied constraint satisfaction problems (CSPs) and maximum
constraint satisfaction problems (Max-CSPs).
Our main result is a precise algebraic characterisation of valued constraint
languages whose instances can be solved exactly by the basic linear programming
relaxation. Using this result, we obtain tractability of several novel and
previously widely-open classes of VCSPs, including problems over valued
constraint languages that are: (1) submodular on arbitrary lattices; (2)
bisubmodular (also known as k-submodular) on arbitrary finite domains; (3)
weakly (and hence strongly) tree-submodular on arbitrary trees.Comment: Corrected a few typo
QCSP on partially reflexive forests
We study the (non-uniform) quantified constraint satisfaction problem QCSP(H)
as H ranges over partially reflexive forests. We obtain a complexity-theoretic
dichotomy: QCSP(H) is either in NL or is NP-hard. The separating condition is
related firstly to connectivity, and thereafter to accessibility from all
vertices of H to connected reflexive subgraphs. In the case of partially
reflexive paths, we give a refinement of our dichotomy: QCSP(H) is either in NL
or is Pspace-complete
Approximate Analytical Solutions to the Initial Data Problem of Black Hole Binary Systems
We present approximate analytical solutions to the Hamiltonian and momentum
constraint equations, corresponding to systems composed of two black holes with
arbitrary linear and angular momentum. The analytical nature of these initial
data solutions makes them easier to implement in numerical evolutions than the
traditional numerical approach of solving the elliptic equations derived from
the Einstein constraints. Although in general the problem of setting up initial
conditions for black hole binary simulations is complicated by the presence of
singularities, we show that the methods presented in this work provide initial
data with and norms of violation of the constraint equations
falling below those of the truncation error (residual error due to
discretization) present in finite difference codes for the range of grid
resolutions currently used. Thus, these data sets are suitable for use in
evolution codes. Detailed results are presented for the case of a head-on
collision of two equal-mass M black holes with specific angular momentum 0.5M
at an initial separation of 10M. A straightforward superposition method yields
data adequate for resolutions of , and an "attenuated" superposition
yields data usable to resolutions at least as fine as . In addition, the
attenuated approximate data may be more tractable in a full (computational)
exact solution to the initial value problem.Comment: 6 pages, 5 postscript figures. Minor changes and some points
clarified. Accepted for publication in Phys. Rev.
Discrete Convex Functions on Graphs and Their Algorithmic Applications
The present article is an exposition of a theory of discrete convex functions
on certain graph structures, developed by the author in recent years. This
theory is a spin-off of discrete convex analysis by Murota, and is motivated by
combinatorial dualities in multiflow problems and the complexity classification
of facility location problems on graphs. We outline the theory and algorithmic
applications in combinatorial optimization problems
The power of linear programming for general-valued CSPs
Let , called the domain, be a fixed finite set and let , called
the valued constraint language, be a fixed set of functions of the form
, where different functions might have
different arity . We study the valued constraint satisfaction problem
parametrised by , denoted by VCSP. These are minimisation
problems given by variables and the objective function given by a sum of
functions from , each depending on a subset of the variables.
Finite-valued constraint languages contain functions that take on only rational
values and not infinite values.
Our main result is a precise algebraic characterisation of valued constraint
languages whose instances can be solved exactly by the basic linear programming
relaxation (BLP). For a valued constraint language , BLP is a decision
procedure for if and only if admits a symmetric fractional
polymorphism of every arity. For a finite-valued constraint language ,
BLP is a decision procedure if and only if admits a symmetric
fractional polymorphism of some arity, or equivalently, if admits a
symmetric fractional polymorphism of arity 2.
Using these results, we obtain tractability of several novel classes of
problems, including problems over valued constraint languages that are: (1)
submodular on arbitrary lattices; (2) -submodular on arbitrary finite
domains; (3) weakly (and hence strongly) tree-submodular on arbitrary trees.Comment: A full version of a FOCS'12 paper by the last two authors
(arXiv:1204.1079) and an ICALP'13 paper by the first author (arXiv:1207.7213)
to appear in SIAM Journal on Computing (SICOMP
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
Empirical analysis of the Lieb-Oxford bound in ions and molecules
Universal properties of the Coulomb interaction energy apply to all
many-electron systems. Bounds on the exchange-correlation energy, inparticular,
are important for the construction of improved density functionals. Here we
investigate one such universal property -- the Lieb-Oxford lower bound -- for
ionic and molecular systems. In recent work [J. Chem. Phys. 127, 054106
(2007)], we observed that for atoms and electron liquids this bound may be
substantially tightened. Calculations for a few ions and molecules suggested
the same tendency, but were not conclusive due to the small number of systems
considered. Here we extend that analysis to many different families of ions and
molecules, and find that for these, too, the bound can be empirically tightened
by a similar margin as for atoms and electron liquids. Tightening the
Lieb-Oxford bound will have consequences for the performance of various
approximate exchange-correlation functionals.Comment: 8 pages, 3 color figure
- …