Sciweavers

601 search results - page 9 / 121
» Quantified Equality Constraints
Sort
View
ICDT
2010
ACM
259views Database» more  ICDT 2010»
14 years 6 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira
FUIN
2010
83views more  FUIN 2010»
13 years 6 months ago
Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...
Vince Bárány, Lukasz Kaiser, Alexand...
CPAIOR
2008
Springer
13 years 10 months ago
Propagating Separable Equalities in an MDD Store
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
Tarik Hadzic, John N. Hooker, Peter Tiedemann
CP
2006
Springer
14 years 14 days ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière
CP
2010
Springer
13 years 6 months ago
The Lattice Structure of Sets of Surjective Hyper-Operations
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Barnaby Martin