834 search results - page 27 / 167 » Computing Minimal Models, Stable Models, and Answer Sets |
PODS
2003
ACM
15 years 12 months ago
2003
ACM
In this paper we propose a new bottom-up query evaluation method for stratified deductive databases based on the Magic Set approach. As the Magic Sets rewriting may lead to unstra...
161
click to vote
COR
2011
14 years 6 months ago
2011
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
RSS
2007
15 years 1 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
102
click to vote
SOFSEM
2010
Springer
15 years 8 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
SEMWEB
2007
Springer
15 years 5 months ago
2007
Springer
The ability to compute the differences that exist between two RDF models is an important step to cope with the evolving nature of the Semantic Web (SW). In particular, RDF Deltas c...