207 search results - page 3 / 42 » Proof Systems and Transformation Games |
ISSAC
1990
Springer
15 years 1 months ago
1990
Springer
In the previous papers [7-101we defined and explored a formal methodological framework on the basis of which resolution proof systems for strongly-finite logics can be introduced ...
TABLEAUX
2005
Springer
15 years 3 months ago
2005
Springer
For applications of first-order automated theorem provers in a wider verification context it is essential to provide a means of presenting and checking automatically found proofs...
109
click to vote
STACS
2005
Springer
15 years 3 months ago
2005
Springer
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
CALCO
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...