769 search results - page 27 / 154 » Where Is the Proof |
143
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
142
click to vote
TABLEAUX
2009
Springer
15 years 10 months ago
2009
Springer
We define a notion of formula schema handling arithmetic parameters, indexed propositional variables (e.g. Pi) and iterated conjunctions/disjunctions (e.g. Vn i=1 Pi, where n is a...
114
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
145
click to vote
APSEC
2005
IEEE
15 years 9 months ago
2005
IEEE
— Invariant based programming is an approach to program construction where we provide the program pre- and postconditions as well as loop invariants before we construct the code ...
137
click to vote
FOCS
1993
IEEE
15 years 8 months ago
1993
IEEE
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...