Sciweavers

1032 search results - page 101 / 207
» Extended Computation Tree Logic
Sort
View
167
Voted
STACS
1993
Springer
15 years 7 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
137
Voted
REX
1991
15 years 7 months ago
From Timed to Hybrid Systems
We propose a framework for the formal speci cation and veri cation of timed and hybrid systems. For timed systems we propose a speci cation language that refers to time only throug...
Oded Maler, Zohar Manna, Amir Pnueli
AMAST
2008
Springer
15 years 5 months ago
Service Specification and Matchmaking Using Description Logic
ed Abstract an extended abstract of [11]. Service-oriented computing is emerging as a new paradigm based on autonomous, platform-independent computational entities, called services...
M. Birna van Riemsdijk, Rolf Hennicker, Martin Wir...
CONPAR
1992
15 years 7 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
140
Voted
SEBD
2007
121views Database» more  SEBD 2007»
15 years 5 months ago
Query Answering in Expressive Variants of DL-Lite
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
Alessandro Artale, Diego Calvanese, Roman Kontchak...