Sciweavers

4218 search results - page 311 / 844
» Complete sets of cooperations
Sort
View
ENTCS
2007
99views more  ENTCS 2007»
15 years 7 months ago
Nominal Equational Logic
This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is a...
Ranald A. Clouston, Andrew M. Pitts
192
Voted
NLE
2008
107views more  NLE 2008»
15 years 7 months ago
A finite-state morphological grammar of Hebrew
Morphological analysis is a crucial component of several natural language processing tasks, especially for languages with a highly productive morphology, where stipulating a full ...
S. Yona, S. Wintner
NJC
2006
86views more  NJC 2006»
15 years 7 months ago
Axiomatizing Binding Bigraphs
We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove tha...
Troels Christoffer Damgaard, Lars Birkedal
SYNTHESE
2008
81views more  SYNTHESE 2008»
15 years 7 months ago
Decision framing in judgment aggregation
Judgment aggregation problems are language dependent in that they may be framed in different yet equivalent ways. We formalize this dependence via the notion of translation invari...
Fabrizio Cariani, Marc Pauly, Josh Snyder
194
Voted
ALIFE
2004
15 years 7 months ago
Avida: A Software Platform for Research in Computational Evolutionary Biology
The Avida digital evolution platform is a software tool used to perform experimental evolution research with self-replicating computer programs ("digital organisms"). Av...
Charles Ofria, Claus O. Wilke