2233 search results - page 38 / 447 » On the Complexity of Theory Curbing |
116
click to vote
COLING
1990
15 years 3 months ago
1990
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular atte...
RIVF
2007
15 years 3 months ago
2007
Abstract— We propose in this paper a generalization of percolation processes in Z2 using the pretopology theory. We formalize the notion of neighborhood by extending it to the co...
116
click to vote
MST
2008
15 years 1 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
128
click to vote
ECAL
1995
Springer
15 years 5 months ago
1995
Springer
Arti cial Life and the more general area of Complex Systems does not have a uni ed theoretical framework although most theoretical work in these areas is based on simulation. This ...
108
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...