Sciweavers

268 search results - page 10 / 54
» Expressive Power of Grammatical Formalisms
Sort
View
AAAI
2011
12 years 8 months ago
Transportability of Causal and Statistical Relations: A Formal Approach
We address the problem of transferring information learned from experiments to a different environment, in which only passive observations can be collected. We introduce a formal ...
Judea Pearl, Elias Bareinboim
GC
2004
Springer
14 years 1 months ago
Towards a Formal Treatment of Secrecy Against Computational Adversaries
Polynomial time adversaries based on a computational view of cryptography have additional capabilities that the classical Dolev-Yao adversary model does not include. To relate thes...
Angelo Troina, Alessandro Aldini, Roberto Gorrieri
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 8 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
ICDT
2007
ACM
74views Database» more  ICDT 2007»
14 years 10 days ago
World-Set Decompositions: Expressiveness and Efficient Algorithms
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
Lyublena Antova, Christoph Koch, Dan Olteanu
EDBT
2006
ACM
144views Database» more  EDBT 2006»
14 years 8 months ago
Towards Expressive Publish/Subscribe Systems
Traditional content based publish/subscribe (pub/sub) systems allow users to express stateless subscriptions evaluated on individual events. However, many applications such as moni...
Alan J. Demers, Johannes Gehrke, Mingsheng Hong, M...