No label defined (Q3336735)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3870639
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3870639

      Statements

      1984
      0 references
      equational clause
      0 references
      validity
      0 references
      satisfiability
      0 references
      resolution
      0 references
      refutation
      0 references
      narrowing
      0 references
      0 references
      [For the entire collection see Zbl 0537.00025.] Let T denote the set of terms constructed from operators in a set \(\Sigma\) and variables in a set V. An equational clause in T is a disjunction of literals of the form: \(''t_ 1=t_ 2''\) or \(''t_ 1\neq t_ 2''\) where \(t_ 1\) and \(t_ 2\) are terms. If E is a set of equations and \(I(\Sigma\),E) is the standard model defined by E then a clause C is E-valid iff C is valid in \(I(\Sigma\),E). In the paper it is shown that the E-validity problem can be reduced to a problem of equality-satisfiability, which is a semi-decidable problem and can be treated with a standard method of resolution with paramodulation. Next, complete refutation procedures based on narrowing and resolution are introduced. These procedures generate efficient E-invalidity proofs. The completeness and soundness of the procedures are given. In conclusion it is shown that the procedure can be regarded as a prover for program properties.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references