2585 search results - page 327 / 517 » Automating Coherent Logic |
143
click to vote
CADE
2005
Springer
16 years 6 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...
154
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
We introduce XOR constraints, and show how they enable a theorem prover to reason effectively about security critical subsystems which employ bitwise XOR. Our primary case study is...
184
click to vote
CADE
2004
Springer
16 years 6 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...
189
click to vote
CADE
2003
Springer
16 years 6 months ago
2003
Springer
IsaPlanner is a generic framework for proof planning in the interactive theorem prover Isabelle. It facilitates the encoding of reasoning techniques, which can be used to conjectur...
