2479 search results - page 170 / 496 » Quantum complexity theory |
165
click to vote
LICS
2000
IEEE
15 years 11 months ago
2000
IEEE
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
190
click to vote
DOOD
1993
Springer
15 years 11 months ago
1993
Springer
In this paper we introduce a logical query language extended with object-oriented typing facilities. This language, called DTL (from DataTypeLog), can be seen as an extension of Da...
169
click to vote
AB
2007
Springer
15 years 10 months ago
2007
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equations. ...
180
click to vote
ITP
2010
15 years 10 months ago
2010
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
177
click to vote
AUSAI
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we generalize our formal approach to modelling PRS agents away from PRS-specific assumptions to more general theories of rationality, while not losing the concretene...