827 search results - page 77 / 166 » Proof-Theoretic Soundness and Completeness |
170
click to vote
TARK
2005
Springer
15 years 11 months ago
2005
Springer
s for Multi-Agent Only Knowing (extended abstract) Arild Waaler1,2 and Bjørnar Solhaug3,4 1 Finnmark College, Norway 2 Dep. of Informatics, University of Oslo, Norway 3 SINTEF ICT...
145
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
147
click to vote
FATES
2004
Springer
15 years 11 months ago
2004
Springer
We present the development of T-UPPAAL — a new tool for online black-box testing of real-time embedded systems from non-deterministic timed automata specifications. It is based ...
137
click to vote
FMCAD
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
159
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Practical description logic systems play an ever-growing role for knowledge representation and reasoning research even in distributed environments. In particular, the often-discus...