4617 search results - page 477 / 924 » Automation of Diagrammatic Reasoning |
152
click to vote
LPAR
2010
Springer
15 years 5 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...
175
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
157
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
The classic method of Nelson and Oppen for combining decision procedures requires the theories to be stably-infinite. Unfortunately, some important theories do not fall into this...
178
click to vote
PRICAI
2010
Springer
15 years 5 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...
206
click to vote
RR
2010
Springer
15 years 5 months ago
2010
Springer
Translations to (first-order) datalog have been used in a number of inferencing techniques for description logics (DLs), yet the relationship between the semantic expressivities o...