Corpus ID: 857274

Unification procedures in automated deduction methods based on matings: A survey

@inproceedings{Gallier1992UnificationPI,
  title={Unification procedures in automated deduction methods based on matings: A survey},
  author={J. Gallier},
  booktitle={Tree Automata and Languages},
  year={1992}
}
  • J. Gallier
  • Published in Tree Automata and Languages 1992
  • Computer Science
  • Unification procedures arising in methods for automated theorem proving based on matings are surveyed. We begin by reviewing some fundamentals of automated deduction, including the Skolem form and the SkolemHerbrand-Godel theorem. Next, the method of matings for first-order languages without equality due to Andrews and Bibel is presented. Standard unification is described in terms of transformations on systems (following the approach of Martelli and Montanari, anticipated by Herbrand). Some… CONTINUE READING
    10 Citations
    Simultaneous Regid E-Unification Is Undecidable
    • 39
    Quantum States and Disjunctive Attacks in Talmudic Logic
    • 1
    • PDF
    Efficient Functional Unification and Substitution
    On Simultaneous Rigid E-Unification
    • 19
    • Highly Influenced
    • PDF
    What Is Essential Unification?
    • 1
    General Connections via Equality Elimination
    • 13
    Data Mining for Studying the Impact of Reflection on Learning
    Cyclic Connections
    • 2
    Equality Reasoning in Sequent-Based Calculi
    • 60
    • PDF

    References

    SHOWING 1-10 OF 92 REFERENCES
    Theorem Proving via General Matings
    • 316
    • PDF
    Complete Sets of Transformations for General E-Unification
    • 148
    • PDF
    AUTOMATING HIGHER-ORDER LOGIC
    • 84
    • PDF
    Proofs in Higher-Order Logic
    • 98
    • PDF
    Proof methods for equational theories
    • 74
    Matching - A Special Case of Unification?
    • H. Bürckert
    • Mathematics, Computer Science
    • J. Symb. Comput.
    • 1989
    • 42
    A Machine-Oriented Logic Based on the Resolution Principle
    • 4,165
    • PDF
    Rigid E-unification is NP-complete
    • 43
    • PDF
    An introduction to mathematical logic and type theory - to truth through proof
    • P. Andrews
    • Mathematics, Computer Science
    • Computer science and applied mathematics
    • 1986
    • 644
    • PDF