117 search results - page 4 / 24 » On Complexity of Model-Checking for the TQL Logic |
CIE
2008
Springer
14 years 11 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
ICLP
1997
Springer
15 years 3 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
ASE
2004
14 years 11 months ago
2004
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...
CSL
2006
Springer
14 years 11 months ago
2006
Springer
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...