186 search results - page 3 / 38 » Tractability of Theory Patching |
AAAI
1997
13 years 7 months ago
1997
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
ACS
2011
13 years 25 days ago
2011
Using the parallel between the preframe and the suplattice approach to locale theory it is shown that the patch construction, as an action on topologies, is the same thing as the ...
JCO
1998
13 years 5 months ago
1998
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
CP
2008
Springer
13 years 7 months ago
2008
Springer
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
ATAL
2007
Springer
13 years 12 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...