892 search results - page 70 / 179 » Strategies in sentential reasoning |
147
click to vote
CADE
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
115
click to vote
KGC
1993
Springer
15 years 8 months ago
1993
Springer
We provide a logical speci cation of set predicates ndall and bagof of Prolog. The speci cation is given in proof theoretic terms, and pertains to any SLD resolution based language...
108
click to vote
ALP
1990
Springer
15 years 8 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
156
click to vote
CSL
2007
Springer
15 years 8 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
133
click to vote
ICCBR
2010
Springer
15 years 8 months ago
2010
Springer
The concept of diversity was successfully introduced for recommender-systems. By displaying results that are not only similar to a target problem but also diverse among themselves,...