Reeves S.V., Semantic tableau as a framework for automated theorem proving., Department of Computer Science and Statistics, Queen Mary College, Univ. of London, 1987 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Representation and Computation of Tableaux Proofs - Schneider, Kumar, Kropf (1992) (1 citation) (Correct)
....following lemma holds: Lemma 2.1 (Size of Structure Sets) The number of atomic formulae of the structure set = of a each formula 2 SF or Sigma is less or equal to the number of atomic formulae in . 3 Unification can be introduced in tableau calculus by using Metavariables (see [Fitt90] [Reev87], ScKK91b] ScKK92] They can be seen as placeholders which are introduced by a fl rule and are instantiated with suitable terms found with unification later on. Substitutions which assign terms to metavariables are called metasubstitutions. 4 Here we use the liberalized ffi rule presented ....
....In other words, no fl structure can be preferred infinitely often. Unification. The fl rule in tableau calculus allows the instantiation of an arbitrary term, but usually only specific terms allow the closure of the tableau path. Therefore tableau calculi with unification have been defined (see [Fitt90, Reev87, ScKK92]) Mainly there are two approaches: in Fitting s approach, the ffi quantifiers are eliminated by the introduction of skolem functions, while in the other two approaches, the ffi rules introduce new eigenvariables 9 . Since the ffi rule of tableau calculus requires that the introduced ....
[Article contains additional citation context not shown here]
Reeves S.V., Semantic tableau as a framework for automated theorem proving., Department of Computer Science and Statistics, Queen Mary College, Univ. of London, 1987
Structuring and Automating Hardware Proofs in a.. - Kumar, Schneider, Kropf (1993) (10 citations) (Correct)
....[43] which overcome these problems by using good heuristics in guessing the right term for substitution. Gamma Delta Gamma 1 Delta 1 . Ax 1 Gamma 2 Delta 2 . Ax 2 Axn Gamma1 . Axn Figure 6: A Closed Proof Tree in SEQ. We on the other hand, use an exact approach like [44] or [39] by postponing the choice of the exact term to an appropriate stage. When the proof tree construction process is ripened, we use first order unification for computing the terms for instantiation. This concept can be thought of as being similar to lazy evaluation within functional language ....
S.V. Reeves. Semantic tableau as a framework for automated theorem proving. Technical report, Department of Computer Science, Queen Mary College, University of London, 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC