Sciweavers

658 search results - page 78 / 132
» A Logic for Graphs with QoS
Sort
View
RTA
2009
Springer
14 years 3 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
DAC
1994
ACM
14 years 7 days 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
13 years 10 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
EACL
1993
ACL Anthology
13 years 10 months ago
Disjunctions and Inheritance in the Context Feature Structure System
Substantial efforts have been made in order to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; DSrre and Eisele, 1990]...
Martin Böttcher
APAL
2008
92views more  APAL 2008»
13 years 8 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