4,970 research outputs found
Preservation and decomposition theorems for bounded degree structures
We provide elementary algorithms for two preservation theorems for
first-order sentences (FO) on the class \^ad of all finite structures of degree
at most d: For each FO-sentence that is preserved under extensions
(homomorphisms) on \^ad, a \^ad-equivalent existential (existential-positive)
FO-sentence can be constructed in 5-fold (4-fold) exponential time. This is
complemented by lower bounds showing that a 3-fold exponential blow-up of the
computed existential (existential-positive) sentence is unavoidable. Both
algorithms can be extended (while maintaining the upper and lower bounds on
their time complexity) to input first-order sentences with modulo m counting
quantifiers (FO+MODm). Furthermore, we show that for an input FO-formula, a
\^ad-equivalent Feferman-Vaught decomposition can be computed in 3-fold
exponential time. We also provide a matching lower bound.Comment: 42 pages and 3 figures. This is the full version of: Frederik
Harwath, Lucas Heimberg, and Nicole Schweikardt. Preservation and
decomposition theorems for bounded degree structures. In Joint Meeting of the
23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th
Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS'14,
pages 49:1-49:10. ACM, 201
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
We prove an algebraic preservation theorem for positive Horn definability in
aleph-zero categorical structures. In particular, we define and study a
construction which we call the periodic power of a structure, and define a
periomorphism of a structure to be a homomorphism from the periodic power of
the structure to the structure itself. Our preservation theorem states that,
over an aleph-zero categorical structure, a relation is positive Horn definable
if and only if it is preserved by all periomorphisms of the structure. We give
applications of this theorem, including a new proof of the known complexity
classification of quantified constraint satisfaction on equality templates
On First-Order Definable Colorings
We address the problem of characterizing -coloring problems that are
first-order definable on a fixed class of relational structures. In this
context, we give several characterizations of a homomorphism dualities arising
in a class of structure
Space Efficiency of Propositional Knowledge Representation Formalisms
We investigate the space efficiency of a Propositional Knowledge
Representation (PKR) formalism. Intuitively, the space efficiency of a
formalism F in representing a certain piece of knowledge A, is the size of the
shortest formula of F that represents A. In this paper we assume that knowledge
is either a set of propositional interpretations (models) or a set of
propositional formulae (theorems). We provide a formal way of talking about the
relative ability of PKR formalisms to compactly represent a set of models or a
set of theorems. We introduce two new compactness measures, the corresponding
classes, and show that the relative space efficiency of a PKR formalism in
representing models/theorems is directly related to such classes. In
particular, we consider formalisms for nonmonotonic reasoning, such as
circumscription and default logic, as well as belief revision operators and the
stable model semantics for logic programs with negation. One interesting result
is that formalisms with the same time complexity do not necessarily belong to
the same space efficiency class
The proof-theoretic strength of Ramsey's theorem for pairs and two colors
Ramsey's theorem for -tuples and -colors () asserts
that every k-coloring of admits an infinite monochromatic
subset. We study the proof-theoretic strength of Ramsey's theorem for pairs and
two colors, namely, the set of its consequences, and show that
is conservative over . This
strengthens the proof of Chong, Slaman and Yang that does not
imply , and shows that is
finitistically reducible, in the sense of Simpson's partial realization of
Hilbert's Program. Moreover, we develop general tools to simplify the proofs of
-conservation theorems.Comment: 32 page
The Generalised Colouring Numbers on Classes of Bounded Expansion
The generalised colouring numbers , ,
and were introduced by Kierstead and Yang as
generalisations of the usual colouring number, also known as the degeneracy of
a graph, and have since then found important applications in the theory of
bounded expansion and nowhere dense classes of graphs, introduced by
Ne\v{s}et\v{r}il and Ossona de Mendez. In this paper, we study the relation of
the colouring numbers with two other measures that characterise nowhere dense
classes of graphs, namely with uniform quasi-wideness, studied first by Dawar
et al. in the context of preservation theorems for first-order logic, and with
the splitter game, introduced by Grohe et al. We show that every graph
excluding a fixed topological minor admits a universal order, that is, one
order witnessing that the colouring numbers are small for every value of .
Finally, we use our construction of such orders to give a new proof of a result
of Eickmeyer and Kawarabayashi, showing that the model-checking problem for
successor-invariant first-order formulas is fixed-parameter tractable on
classes of graphs with excluded topological minors
- …