2062 search results - page 109 / 413 » Derivatives of Logical Formulas |
113
Voted
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of nite structures if every (FO + LFP) formula is equivalent to a rst-order formula in K. H...
114
click to vote
FCS
2007
15 years 5 months ago
2007
Instances of the futile questioning problem abound in applications, especially, in the area of artificial intelligence. The problem can be represented by a particular quantified ...
131
Voted
FMOODS
2003
15 years 5 months ago
2003
A way to write proof scores showing that distributed systems have invariant properties in algebraic specification languages is described, which has been devised through several ca...
165
click to vote
TIT
2008
15 years 2 months ago
2008
Source coding theorems and Shannon rate-distortion functions were studied for the discrete-time Wiener process by Berger and generalized to nonstationary Gaussian autoregressive p...
119
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...