3970 search results - page 432 / 794 » A Logic For Causal Reasoning |
169
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
175
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
303
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...
194
click to vote
CADE
2004
Springer
16 years 7 months ago
2004
Springer
This paper presents the Dr.Doodle system, an interactive theorem prover that uses diagrammatic representations. The assumption underlying this project is that, for some domains (pr...
203
click to vote
TPHOL
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...