587,543 research outputs found
Normal forms for Answer Sets Programming
Normal forms for logic programs under stable/answer set semantics are
introduced. We argue that these forms can simplify the study of program
properties, mainly consistency. The first normal form, called the {\em kernel}
of the program, is useful for studying existence and number of answer sets. A
kernel program is composed of the atoms which are undefined in the Well-founded
semantics, which are those that directly affect the existence of answer sets.
The body of rules is composed of negative literals only. Thus, the kernel form
tends to be significantly more compact than other formulations. Also, it is
possible to check consistency of kernel programs in terms of colorings of the
Extended Dependency Graph program representation which we previously developed.
The second normal form is called {\em 3-kernel.} A 3-kernel program is composed
of the atoms which are undefined in the Well-founded semantics. Rules in
3-kernel programs have at most two conditions, and each rule either belongs to
a cycle, or defines a connection between cycles. 3-kernel programs may have
positive conditions. The 3-kernel normal form is very useful for the static
analysis of program consistency, i.e., the syntactic characterization of
existence of answer sets. This result can be obtained thanks to a novel
graph-like representation of programs, called Cycle Graph which presented in
the companion article \cite{Cos04b}.Comment: 15 pages, To appear in Theory and Practice of Logic Programming
(TPLP
Network inference using asynchronously updated kinetic Ising Model
Network structures are reconstructed from dynamical data by respectively
naive mean field (nMF) and Thouless-Anderson-Palmer (TAP) approximations. For
TAP approximation, we use two methods to reconstruct the network: a) iteration
method; b) casting the inference formula to a set of cubic equations and
solving it directly. We investigate inference of the asymmetric Sherrington-
Kirkpatrick (S-K) model using asynchronous update. The solutions of the sets
cubic equation depend of temperature T in the S-K model, and a critical
temperature Tc is found around 2.1. For T < Tc, the solutions of the cubic
equation sets are composed of 1 real root and two conjugate complex roots while
for T > Tc there are three real roots. The iteration method is convergent only
if the cubic equations have three real solutions. The two methods give same
results when the iteration method is convergent. Compared to nMF, TAP is
somewhat better at low temperatures, but approaches the same performance as
temperature increase. Both methods behave better for longer data length, but
for improvement arises, TAP is well pronounced.Comment: 6 pages, 4 figure
Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations
In this article we focus on the parameterized complexity of the
Multidimensional Binary Vector Assignment problem (called \BVA). An input of
this problem is defined by disjoint sets , each
composed of binary vectors of size . An output is a set of disjoint
-tuples of vectors, where each -tuple is obtained by picking one vector
from each set . To each -tuple we associate a dimensional vector by
applying the bit-wise AND operation on the vectors of the tuple. The
objective is to minimize the total number of zeros in these vectors. mBVA
can be seen as a variant of multidimensional matching where hyperedges are
implicitly locally encoded via labels attached to vertices, but was originally
introduced in the context of integrated circuit manufacturing.
We provide for this problem FPT algorithms and negative results (-based
results, [2]-hardness and a kernel lower bound) according to several
parameters: the standard parameter i.e. the total number of zeros), as well
as two parameters above some guaranteed values.Comment: 16 pages, 6 figure
- …