4573 search results - page 369 / 915 » Automated Reasoning |
152
Voted
CADE
2006
Springer
16 years 7 months ago
2006
Springer
One of the keys to the success of the TPTP and related projects is their consistent use of the TPTP language. The ability of the TPTP language to express solutions as well as probl...
148
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must...
189
click to vote
CADE
2004
Springer
16 years 7 months ago
2004
Springer
Lambda logic is the union of first order logic and lambda calculus. We prove basic metatheorems for both total and partial versions of lambda logic. We use lambda logic to state a...
188
click to vote
CADE
2004
Springer
16 years 7 months ago
2004
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
182
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
A classical higher-order logic PFsub of partial functions is defined. The logic extends a version of Farmer's logic PF by enriching the type system of the logic with subset ty...