Sciweavers

562 search results - page 6 / 113
» Ordered Sets in the Calculus of Data Structures
Sort
View
UAI
2001
14 years 11 months ago
A Calculus for Causal Relevance
We present a sound and complete calculus for causal relevance that uses Pearl's functional causal models as semantics. The calculus consists of axioms and rules of inference ...
Blai Bonet
IDEAS
2007
IEEE
146views Database» more  IDEAS 2007»
15 years 3 months ago
Approximate Structural Matching over Ordered XML Documents
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 4 months ago
Psi-calculi: a framework for mobile processes with nominal data and logic
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processe...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...
LICS
2007
IEEE
15 years 3 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
CONCUR
2009
Springer
15 years 4 months ago
Model-Checking Games for Fixpoint Logics with Partial Order Models
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....
Julian Gutierrez, Julian C. Bradfield