Sciweavers

616 search results - page 79 / 124
» Bounded Model Checking with Description Logic Reasoning
Sort
View
LICS
2009
IEEE
14 years 3 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
CAV
2007
Springer
86views Hardware» more  CAV 2007»
14 years 2 months ago
From Liveness to Promptness
Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bo...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
LATIN
2004
Springer
14 years 2 months ago
Approximating the Expressive Power of Logics in Finite Models
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
Argimiro Arratia, Carlos E. Ortiz
DLOG
2010
13 years 6 months ago
Updating TBoxes in DL-Lite
Abstract. We study the problem of updates for TBoxes represented in Description Logics of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of...
Dmitriy Zheleznyakov, Diego Calvanese, Evgeny Khar...
RR
2007
Springer
14 years 2 months ago
A Semantic Framework for Language Layering in WSML
Abstract. WSML presents a framework encompassing different language variants, rooted in Description Logics and (F-)Logic Programming. So far, the precise relationships between thes...
Jos de Bruijn, Stijn Heymans