4 citations
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2005★ 3 cited
The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable
Joost Engelfriet, Sebastian Maneth
It is decidable for deterministic MSO definable graph-to-string or graph-to-tree transducers whether they are equivalent on a context-free set of graphs.
cs.LO2004
Removing Propagation Redundant Constraints in Redundant Modeling
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with various degrees of constraint propagation for pruning the search space. O…