150 search results - page 26 / 30 » Complexity of the Unique Extension Problem in Default Logic |
TIME
2009
IEEE
15 years 4 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
112
click to vote
JCST
2010
14 years 4 months ago
2010
With recent efforts to build foundational certified software systems, two different approaches have been proposed to certify thread context switching. One is to certify both thread...
CADE
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
KR
1992
Springer
15 years 1 months ago
1992
Springer
While it has been realized for quite some time within AI that abduction is a general model of explanation for a variety of tasks, there have been no empirical investigations into ...