4,655 research outputs found
Subsumption Algorithms for Three-Valued Geometric Resolution
In our implementation of geometric resolution, the most costly operation is
subsumption testing (or matching): One has to decide for a three-valued,
geometric formula, if this formula is false in a given interpretation. The
formula contains only atoms with variables, equality, and existential
quantifiers. The interpretation contains only atoms with constants. Because the
atoms have no term structure, matching for geometric resolution is hard. We
translate the matching problem into a generalized constraint satisfaction
problem, and discuss several approaches for solving it efficiently, one direct
algorithm and two translations to propositional SAT. After that, we study
filtering techniques based on local consistency checking. Such filtering
techniques can a priori refute a large percentage of generalized constraint
satisfaction problems. Finally, we adapt the matching algorithms in such a way
that they find solutions that use a minimal subset of the interpretation. The
adaptation can be combined with every matching algorithm. The techniques
presented in this paper may have applications in constraint solving independent
of geometric resolution.Comment: This version was revised on 18.05.201
Testing Low Complexity Affine-Invariant Properties
Invariance with respect to linear or affine transformations of the domain is
arguably the most common symmetry exhibited by natural algebraic properties. In
this work, we show that any low complexity affine-invariant property of
multivariate functions over finite fields is testable with a constant number of
queries. This immediately reproves, for instance, that the Reed-Muller code
over F_p of degree d < p is testable, with an argument that uses no detailed
algebraic information about polynomials except that low degree is preserved by
composition with affine maps.
The complexity of an affine-invariant property P refers to the maximum
complexity, as defined by Green and Tao (Ann. Math. 2008), of the sets of
linear forms used to characterize P. A more precise statement of our main
result is that for any fixed prime p >=2 and fixed integer R >= 2, any
affine-invariant property P of functions f: F_p^n -> [R] is testable, assuming
the complexity of the property is less than p. Our proof involves developing
analogs of graph-theoretic techniques in an algebraic setting, using tools from
higher-order Fourier analysis.Comment: 38 pages, appears in SODA '1
- …