3658 search results - page 95 / 732 » The logic of proofs, semantically |
AISC
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. We present an automatic approach for instantiating existentially quantified variables in inductive specifications proofs. Our approach uses first-order meta-variables in ...
LMCS
2006
13 years 10 months ago
2006
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing tha...
CADE
2011
Springer
12 years 10 months ago
2011
Springer
This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivotsWithIntersection, performs partial regularization, re...
DBPL
1997
Springer
14 years 2 months ago
1997
Springer
Abstract. In the context of the object-oriented data model, a compiletime approach is given that provides for a significant reduction of the amount of run-time transaction overhead...
TPLP
2002
13 years 10 months ago
2002
It is important that practical data-flow analyzers are backed by reliably proven theoretical Abstract interpretation provides a sound mathematical framework and necessary properti...