Sciweavers

395 search results - page 67 / 79
» Predicate Abstraction with Minimum Predicates
Sort
View
CONCUR
2009
Springer
14 years 1 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
ICLP
2007
Springer
14 years 1 months ago
OnEQL: An Ontology Efficient Query Language Engine for the Semantic Web
Abstract. In this paper we describe the OnEQL system, a query engine that implements optimization techniques and evaluation strategies to speed up the evaluation time of querying a...
Edna Ruckhaus, Maria-Esther Vidal, Eduardo Ruiz
ADBIS
2006
Springer
135views Database» more  ADBIS 2006»
14 years 1 months ago
Interactive Discovery and Composition of Complex Web Services
Among the most important expected benefits of a global service oriented architecture leveraging web service standards is an increased level of automation in the discovery, composit...
Sergey A. Stupnikov, Leonid A. Kalinichenko, St&ea...
ADBIS
2006
Springer
165views Database» more  ADBIS 2006»
14 years 1 months ago
Fragmenting XML Documents via Structural Constraints
Abstract. XML query processors suffer from main-memory limitations that prevent them from processing large XML documents. While content-based predicates can be used to project down...
Angela Bonifati, Alfredo Cuzzocrea, Bruno Zinno
CINQ
2004
Springer
116views Database» more  CINQ 2004»
14 years 1 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...