367 search results - page 39 / 74 » A Rewriting Logic Sampler |
112
click to vote
TABLEAUX
2000
Springer
15 years 7 months ago
2000
Springer
We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a m...
129
Voted
CADE
2009
Springer
15 years 10 months ago
2009
Springer
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent deve...
134
click to vote
PPDP
2004
Springer
15 years 8 months ago
2004
Springer
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
232
click to vote
AMAST
2010
Springer
14 years 10 months ago
2010
Springer
Maude modules can be understood as models that can be formally analyzed and verified with respect to different properties expressing various formal requirements. However, Maude lac...
237
Voted
POPL
2005
ACM
16 years 3 months ago
2005
ACM
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...