2062 search results - page 182 / 413 » Derivatives of Logical Formulas |
164
click to vote
SIGCSE
2002
ACM
15 years 4 months ago
2002
ACM
This paper describes a tutorial program that serves a double role as an educational tool and a research environment. First, it introduces students to fundamental concepts of propo...
108
click to vote
CADE
2002
Springer
16 years 4 months ago
2002
Springer
The reflection theorem has been proved using Isabelle/ZF. This theorem cannot be expressed in ZF, and its proof requires reasoning at the meta-level. There is a particularly elegan...
102
click to vote
CADE
2001
Springer
16 years 4 months ago
2001
Springer
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
115
click to vote
CADE
2001
Springer
16 years 4 months ago
2001
Springer
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
147
click to vote
TPHOL
2008
IEEE
15 years 10 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...