Sciweavers

2273 search results - page 98 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
CIE
2008
Springer
14 years 10 months ago
First-Order Model Checking Problems Parameterized by the Model
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
Barnaby Martin
TASE
2008
IEEE
15 years 4 months ago
PDL over Accelerated Labeled Transition Systems
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
Taolue Chen, Jaco van de Pol, Yanjing Wang
BIBE
2004
IEEE
179views Bioinformatics» more  BIBE 2004»
15 years 1 months ago
Incorporating Ontology-Driven Similarity Knowledge into Functional Genomics: An Exploratory Study
This research explores the feasibility of semantic similarity approaches to supporting predictive tasks in functional genomics. It aims to establish potential relationships betwee...
Francisco Azuaje, Olivier Bodenreider
ACTA
2002
111views more  ACTA 2002»
14 years 9 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
SIGMOD
2010
ACM
149views Database» more  SIGMOD 2010»
14 years 4 months ago
On models and query languages for probabilistic processes
Probabilistic processes appear naturally in various contexts, with applications to Business Processes, XML data management and more. Many models for specifying and querying such p...
Daniel Deutch, Tova Milo