25 search results - page 1 / 5 » A Decision Procedure for CTL* Based on Tableaux and Automata |
83
Voted
CADE
2010
Springer
15 years 2 months ago
2010
Springer
104
click to vote
CADE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
109
Voted
ENTCS
2010
14 years 10 months ago
2010
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
91
Voted
ICLP
2007
Springer
15 years 7 months ago
2007
Springer
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...
106
Voted
JAPLL
2010
14 years 7 months ago
2010
We present a decision procedure for hybrid logic equipped with nominals, the satisfaction operator and existential, difference, converse, reflexive, symmetric and transitive modal...