45 search results - page 8 / 9 » The complexity of satisfiability for fragments of hybrid log... |
IFIP
2001
Springer
13 years 10 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
JACM
2010
13 years 4 months ago
2010
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
JANCL
2008
13 years 5 months ago
2008
This paper employs epistemic logic to investigate the philosophical foundations of Bayesian updating in belief revision. By Bayesian updating, we understand the tenet that an agen...
FOSSACS
2008
Springer
13 years 7 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
KR
2010
Springer
13 years 10 months ago
2010
Springer
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...