150 search results - page 10 / 30 » Parameterized Modal Satisfiability |
82
Voted
STACS
2000
Springer
15 years 4 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
127
click to vote
FOSSACS
1999
Springer
15 years 4 months ago
1999
Springer
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm ...
113
Voted
LOGCOM
2007
15 years 9 days ago
2007
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
81
Voted
JUCS
2006
15 years 12 days ago
2006
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
131
Voted
LPAR
2010
Springer
14 years 10 months ago
2010
Springer
We describe a technique and a tool called Qex for generating input tables and parameter values for a given parameterized SQL query. The evaluation semantics of an SQL query is tra...