128 search results - page 1 / 26 » Tractable Cover Compilations |
IJCAI
1997
13 years 6 months ago
1997
Tractable covers are introduced as a new ap proach to equivalence-preserving compilation of propositional knowledge bases. First, a gen eral framework is presented. Then, two ...
AAAI
2006
13 years 6 months ago
2006
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
WADS
2005
Springer
13 years 11 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
ANTSW
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
IPL
2011
13 years 12 days ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...