Free variables and theories: revisiting rigid E-unification

DOI10.1007/978-3-319-24246-0_1MaRDI QIDQ2964448zbMATH OpenOpenAlexFDO

Authors Peter Backeman, Philipp Rümmer

Publication date 27 February 2017

Published in Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-24246-0_1

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Theorem proving with bounded rigid \(E\)-unification
• Efficient algorithms for bounded rigid \(E\)-unification
• scientific article; zbMATH DE number 1552529
• What you always wanted to know about rigid \(E\)-unification
• Special cases and substitutes for rigid \(E\)-unification

Cites work

• scientific article; zbMATH DE number 1614698 (Why is no real title available?)
• scientific article; zbMATH DE number 1950258 (Why is no real title available?)
• scientific article; zbMATH DE number 837700 (Why is no real title available?)
• A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic
• Efficient algorithms for bounded rigid \(E\)-unification
• Equality reasoning in sequent-based calculi
• Presburger arithmetic with unary predicates is Π₁¹ complete
• The undecidability of simultaneous rigid E-unification
• Theorem proving using equational matings and rigid E -unification
• Theorem proving with bounded rigid \(E\)-unification
• What you always wanted to know about rigid \(E\)-unification

Cited in

(2)

• Theorem proving with bounded rigid \(E\)-unification
• Efficient algorithms for bounded rigid \(E\)-unification

This page was built for publication: Free variables and theories: revisiting rigid \(E\)-unification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2964448)