30 search results - page 3 / 6 » The Clarkson-Shor technique revisited and extended |
ECP
1997
Springer
13 years 9 months ago
1997
Springer
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
POS
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. The technique of hyper-programming allows program representations held in a persistent store to contain embedded links to persistent code and data. In 1994, Connor et al ...
AAAI
2000
13 years 6 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
2012
IEEE
11 years 7 months ago
2012
IEEE
Abstract—This paper revisits the classical problem of multiquery optimization in the context of RDF/SPARQL. We show that the techniques developed for relational and semi-structur...
PAAPP
2006
13 years 5 months ago
2006
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...