Sciweavers

778 search results - page 39 / 156
» Expressiveness and complexity of graph logic
Sort
View
87
Voted
AGP
2003
IEEE
15 years 5 months ago
Time Equations for Lazy Functional (Logic) Languages
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
Elvira Albert, Josep Silva, Germán Vidal
TARK
2007
Springer
15 years 6 months ago
Alternating-time temporal logic with explicit strategies
We introduce ATLES – a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences o...
Dirk Walther, Wiebe van der Hoek, Michael Wooldrid...
106
Voted
VLDB
1994
ACM
115views Database» more  VLDB 1994»
15 years 4 months ago
Database Graph Views: A Practical Model to Manage Persistent Graphs
Advanced technical applications like routing systems or electrical network managementsystems introduce the need for complex manipulations of large size graphs. Efficiently support...
Alejandro Gutiérrez, Philippe Pucheral, Her...
CLEIEJ
2007
152views more  CLEIEJ 2007»
15 years 15 days ago
Gene Expression Analysis using Markov Chains extracted from RNNs
Abstract. This paper present a new approach for the analysis of gene expression, by extracting a Markov Chain from trained Recurrent Neural Networks (RNNs). A lot of microarray dat...
Igor Lorenzato Almeida, Denise Regina Pechmann Sim...
114
Voted
ATAL
2009
Springer
15 years 7 months ago
Rational play and rational beliefs under uncertainty
Alternating-time temporal logic (atl) is one of the most influential logics for reasoning about agents’ abilities. Constructive Strategic Logic (csl) is a variant of atl for im...
Nils Bulling, Wojciech Jamroga