4573 search results - page 458 / 915 » Automated Reasoning |
156
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
156
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
139
Voted
LPAR
2010
Springer
15 years 4 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...
160
Voted
LPAR
2010
Springer
15 years 4 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...
150
click to vote
LPAR
2010
Springer
15 years 4 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...