257 search results - page 9 / 52 » The Complexity of Model Checking for Propositional Default L... |
TASE
2008
IEEE
14 years 1 months ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
ECAI
1998
Springer
13 years 11 months ago
1998
Springer
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which...
SEFM
2009
IEEE
14 years 2 months ago
2009
IEEE
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
ENTCS
2007
13 years 7 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
CADE
2012
Springer
11 years 10 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...