Sciweavers

1960 search results - page 303 / 392
» The Logic of Large Enough
Sort
View
ICALP
2009
Springer
14 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
DLOG
2003
13 years 11 months ago
Implementing Matching in ALE--First Results
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
Sebastian Brandt
CASCON
1996
148views Education» more  CASCON 1996»
13 years 11 months ago
Reuse in the application layer
Today's advanced CASE tools, combining the building-block and generative approaches to software reuse, are effective for reuse of software components and procedures in the pr...
Hirotomo Okuno, Hideki Matsumoto, Hironori Asai, M...
LPAR
2010
Springer
13 years 8 months ago
The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic Approach
Abstract. The paper presents the methodology and the results of checking consistency of the knowledge base of CADIAG-2, a large-scale medical expert system. Such knowledge base con...
Pavel Klinov, Bijan Parsia, David Picado-Mui&ntild...
SEMWEB
2010
Springer
13 years 8 months ago
An Expressive and Efficient Solution to the Service Selection Problem
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
Daniel Izquierdo, Maria-Esther Vidal, Blai Bonet