Sciweavers

1712 search results - page 216 / 343
» A Computational Approach to Binding Theory
Sort
View
CPHYSICS
2008
53views more  CPHYSICS 2008»
15 years 6 months ago
Long-time self-diffusion for Brownian Gaussian-core particles
Using extensive Brownian dynamics computer simulations, the long-time self-diffusion coefficient is calculated for Gaussian-core particles as a function of the number density. Bot...
H. H. Wensink, H. Löwen, M. Rex, C. N. Likos,...
ENTCS
2008
72views more  ENTCS 2008»
15 years 6 months ago
Towards a Notion of Transaction in Graph Rewriting
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
Paolo Baldan, Andrea Corradini, Fernando Luí...
JLP
2000
134views more  JLP 2000»
15 years 6 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
JMLR
2002
138views more  JMLR 2002»
15 years 6 months ago
Text Chunking based on a Generalization of Winnow
This paper describes a text chunking system based on a generalization of the Winnow algorithm. We propose a general statistical model for text chunking which we then convert into ...
Tong Zhang, Fred Damerau, David Johnson
LICS
2010
IEEE
15 years 4 months ago
Equality Is Typable in Semi-full Pure Type Systems
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
Vincent Siles, Hugo Herbelin