616 search results - page 8 / 124 » Bounded Model Checking with Description Logic Reasoning |
109
click to vote
IEEEHPCS
2010
14 years 10 months ago
2010
Model checking is a formal verification method widely accepted in the web service world because of its capability to reason about service behaviors, at their process-level. It ha...
DLOG
2008
15 years 2 months ago
2008
QEST
2007
IEEE
15 years 6 months ago
2007
IEEE
Stochastic game logic (SGL) is a new temporal logic that combines features of alternating temporal logic (to formalize the individual views and cooperation and reaction facilities...
DLOG
2010
14 years 9 months ago
2010
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
CSL
2008
Springer
15 years 1 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...