37 search results - page 3 / 8 » SAT-Based Procedures for Temporal Reasoning |
CADE
2005
Springer
14 years 10 months ago
2005
Springer
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic tempo...
TIME
1994
IEEE
14 years 1 months ago
1994
IEEE
We describe in this article an abductive procedure based on a constrained resolution principle. The choice of constrained resolution is motivated by the whish to gain full advanta...
CONCUR
2011
Springer
12 years 9 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
ECCC
2007
13 years 9 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
ATAL
2005
Springer
14 years 3 months ago
2005
Springer
We present a general logic of explicit knowledge represented as finite sets of logical formulae which can evolve by nondeterministic reasoning and communication. It is partly bas...