1076 search results - page 8 / 216 » Operations on proofs and labels |
LICS
2007
IEEE
15 years 3 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
BIRTHDAY
2000
Springer
15 years 1 months ago
2000
Springer
Various forms of assumption/commitment specifications have been used to specify and reason about the interference that comes from concurrent execution; in particular, consistent a...
89
Voted
AIIA
1999
Springer
15 years 1 months ago
1999
Springer
In this paper we show how to extend KEM, a tableau-like proof system for normal modal logic, in order to deal with classes of non-normal modal logics, such as monotonic and regular...
70
Voted
CSR
2006
Springer
15 years 1 months ago
2006
Springer
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...