18 search results - page 1 / 4 » Computing Circumscriptive Databases by Integer Programming: ... |
AAAI
2000
13 years 5 months ago
2000
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
ICDE
2007
IEEE
13 years 10 months ago
2007
IEEE
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
DBPL
2007
Springer
13 years 8 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
GIS
2006
ACM
14 years 5 months ago
2006
ACM
We present a novel method for the automatic generalization of land cover maps. A land cover map is composed of areas that collectively form a tessellation of the plane and each ar...
TCBB
2008
13 years 4 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...