2303 search results - page 290 / 461 » On the logic of argumentation theory |
150
click to vote
ACL
1998
15 years 8 months ago
1998
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
195
click to vote
AAI
2005
15 years 6 months ago
2005
This paper is about people. It is about understanding how learning and communication mutually influence one another; allowing people to infer each other's communicative behavi...
180
click to vote
ENTCS
2011
15 years 1 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, āComputational Complexity in Non-Turing Models of Computationā...
198
click to vote
VSTTE
2012
Springer
14 years 2 months ago
2012
Springer
Motivated by the problem of deciding veriļ¬cation conditions for the veriļ¬cation of functional programs, we present new decision procedures for automated reasoning about functio...
338
click to vote
DIMACS
1996
15 years 7 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...