4224 search results - page 258 / 845 » Reasoning about Choice |
224
click to vote
TIME
2007
IEEE
16 years 1 months ago
2007
IEEE
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
211
click to vote
CAV
2007
Springer
16 years 1 months ago
2007
Springer
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
183
click to vote
GEOS
2005
Springer
16 years 24 days ago
2005
Springer
Continuously moving objects are prevalent in many domains. Although there have been attempts to combine both spatial and temporal relationships from a reasoning, a database, as wel...
202
click to vote
AMAI
2004
Springer
16 years 20 days ago
2004
Springer
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...
190
click to vote
LPAR
2004
Springer
16 years 19 days ago
2004
Springer
Abstract. We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which aims to unleash the hidden potential of quantified reasoning in applications. The Sk...