2585 search results - page 225 / 517 » Automating Coherent Logic |
165
click to vote
ITP
2010
15 years 10 months ago
2010
We present a formalisation of separation logic which, by avoiding the use of existential quantifiers, allows proofs that only use standard equational rewriting methods as found in...
166
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
175
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic tempo...
223
click to vote
FROCOS
2009
Springer
16 years 1 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
165
click to vote
CSL
2007
Springer
16 years 22 days ago
2007
Springer
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...