3342 search results - page 304 / 669 » Automating Abstract Interpretation |
114
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
141
click to vote
PRICAI
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...
140
click to vote
DLOG
2010
15 years 2 months ago
2010
Abstract. This paper investigates Description Logics which allow transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. First,...
136
click to vote
DLOG
2010
15 years 2 months ago
2010
Abstract. We study the problem of updates for TBoxes represented in Description Logics of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of...
167
Voted
DLOG
2010
15 years 2 months ago
2010
Abstract. Recently, the use of the MapReduce framework for distributed RDF Schema reasoning has shown that it is possible to compute the deductive closure of sets of over a billion...