Sciweavers

2911 search results - page 281 / 583
» A Logic of Graph Constraints
Sort
View
CIKM
2009
Springer
16 years 1 months ago
A query language for analyzing networks
With more and more large networks becoming available, mining and querying such networks are increasingly important tasks which are not being supported by database models and query...
Anton Dries, Siegfried Nijssen, Luc De Raedt
RTA
2009
Springer
16 years 1 months ago
An Explicit Framework for Interaction Nets
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
Marc de Falco
232
Voted
DAC
1994
ACM
15 years 10 months ago
Probabilistic Analysis of Large Finite State Machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...
DALT
2008
Springer
15 years 8 months ago
Iterated Belief Revision in the Face of Uncertain Communication
Abstract. This paper offers a formalization of iterated belief revision for multiagent communication using the logic of communication graphs introduced in [15]. In this study we co...
Yoshitaka Suzuki, Satoshi Tojo, Stijn De Saeger
APAL
2008
92views more  APAL 2008»
15 years 6 months ago
The complexity of random ordered structures
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
Joel H. Spencer, Katherine St. John