We overview methods of equality reasoning in sequent-based systems. We consider the history of handling equality in sequent systems, methods based on rigid E-unification, paramodulation-based methods, the equality elimination method and equality reasoning in nonclassical logics
Abstract. Equality logic with or without uninterpreted functions is used for proving the equivalence...
AbstractWe present a refutationally complete set of inference rules for first-order logic with equal...
We present several calculi that integrate equality handling by superposition and ordered param...
We overview methods of equality reasoning in sequent-based systems. We consider the history of handl...
Abstract. We give an approach for deciding satisfiability of equality logic formulas (E-SAT) in conj...
A simple technique for reasoning about equalities that is fast and complete for ground formulas with...
AbstractThe negation of equality is an important relation that arises naturally in the study of equa...
We demonstrate how to handle equality in the inverse method using equality elimination. In the equal...
International audienceThe kinds of inference rules and decision procedures that one writes for proof...
The automation of reasoning has been an aim of research for a long time. Already in 17th century, th...
AbstractEquational logic programming is an extended programming paradigm of equational programming. ...
AbstractThe kinds of inference rules and decision procedures that one writes for proofs involving eq...
In informal mathematical usage we often reason using languages with binding. We usually find ourselv...
We present a framework for the integration of the Knuth-Bendix completion algorithm with narrowing m...
AbstractThe logic of Equalities with Uninterpreted Functions is used in the formal verification comm...
Abstract. Equality logic with or without uninterpreted functions is used for proving the equivalence...
AbstractWe present a refutationally complete set of inference rules for first-order logic with equal...
We present several calculi that integrate equality handling by superposition and ordered param...
We overview methods of equality reasoning in sequent-based systems. We consider the history of handl...
Abstract. We give an approach for deciding satisfiability of equality logic formulas (E-SAT) in conj...
A simple technique for reasoning about equalities that is fast and complete for ground formulas with...
AbstractThe negation of equality is an important relation that arises naturally in the study of equa...
We demonstrate how to handle equality in the inverse method using equality elimination. In the equal...
International audienceThe kinds of inference rules and decision procedures that one writes for proof...
The automation of reasoning has been an aim of research for a long time. Already in 17th century, th...
AbstractEquational logic programming is an extended programming paradigm of equational programming. ...
AbstractThe kinds of inference rules and decision procedures that one writes for proofs involving eq...
In informal mathematical usage we often reason using languages with binding. We usually find ourselv...
We present a framework for the integration of the Knuth-Bendix completion algorithm with narrowing m...
AbstractThe logic of Equalities with Uninterpreted Functions is used in the formal verification comm...
Abstract. Equality logic with or without uninterpreted functions is used for proving the equivalence...
AbstractWe present a refutationally complete set of inference rules for first-order logic with equal...
We present several calculi that integrate equality handling by superposition and ordered param...