130 search results - page 9 / 26 » The road to two theorems of logic |
EATCS
2000
14 years 9 months ago
2000
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
EPIA
2005
Springer
15 years 3 months ago
2005
Springer
Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly ...
ISIPTA
2003
IEEE
15 years 3 months ago
2003
IEEE
Dempster’s rule for combining two belief functions assumes the independence of the sources of information. If this assumption is questionable, I suggest to use the least speci�...
116
click to vote
DLT
2010
14 years 11 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
112
click to vote
JAR
2008
14 years 9 months ago
2008
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...