276 search results - page 41 / 56 » From Model-Checking to Temporal Logic Constraint Solving |
125
click to vote
ASP
2001
Springer
15 years 5 months ago
2001
Springer
In this paper we implement planning using answer set programming. We consider the action language A and its extensions. We show that when the domain is described using richer feat...
ICLP
2004
Springer
15 years 6 months ago
2004
Springer
A novel style of multi-agent system specification and deployment is described, in which familiar methods from computational logic are re-interpreted to a new context. One view of ...
101
click to vote
CVIU
2004
15 years 1 months ago
2004
We present a new representation and recognition method for human activities. An activity is considered to be composed of action threads, each thread being executed by a single act...
101
click to vote
DAC
2008
ACM
16 years 2 months ago
2008
ACM
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
117
click to vote
GLVLSI
2009
IEEE
15 years 8 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...