Abstract We investigate and compare various ways of transforming equality formulas to propositional formulas, in order to be able to solve satisfiability in equality logic by means of satisfiability in propositional logic. We propose equality substitution as a new approach combining desirable properties of earlier methods, we prove its correctness and show its applicability by experiments
A simple technique for reasoning about equalities that is fast and complete for ground formulas with...
Abstract. The paper studies reductions of propositional theories in equilibrium logic to logic progr...
We overview methods of equality reasoning in sequent-based systems. We consider the history of handl...
AbstractWe investigate and compare various ways of transforming equality formulas to propositional f...
Abstract We investigate and compare various ways of transforming equality formulas to propositional ...
We investigate and compare various ways of transforming equality for-mulas to propositional formulas...
Abstract. Equality logic with or without uninterpreted functions is used for proving the equivalence...
Abstract. We give an approach for deciding satisfiability of equality logic formulas (E-SAT) in con...
Abstract. The main purpose of this paper is to present a new algorithm (NEW-SAT) for deciding the (u...
The thesis [1] concerns propositional satisfiability (SAT). As it is well known, this problem consis...
AbstractThe negation of equality is an important relation that arises naturally in the study of equa...
AbstractEquational logic programming is an extended programming paradigm of equational programming. ...
In papers [3], [4], [5] Authors presented a new method of solving some kinds of computational tasks ...
The determinant of the Boolean Formulae a = {C1,…,Cm} was introduced in [1]. The present pape...
This paper presents a novel simplification calculus for propositional logic derived from Peirce’s Ex...
A simple technique for reasoning about equalities that is fast and complete for ground formulas with...
Abstract. The paper studies reductions of propositional theories in equilibrium logic to logic progr...
We overview methods of equality reasoning in sequent-based systems. We consider the history of handl...
AbstractWe investigate and compare various ways of transforming equality formulas to propositional f...
Abstract We investigate and compare various ways of transforming equality formulas to propositional ...
We investigate and compare various ways of transforming equality for-mulas to propositional formulas...
Abstract. Equality logic with or without uninterpreted functions is used for proving the equivalence...
Abstract. We give an approach for deciding satisfiability of equality logic formulas (E-SAT) in con...
Abstract. The main purpose of this paper is to present a new algorithm (NEW-SAT) for deciding the (u...
The thesis [1] concerns propositional satisfiability (SAT). As it is well known, this problem consis...
AbstractThe negation of equality is an important relation that arises naturally in the study of equa...
AbstractEquational logic programming is an extended programming paradigm of equational programming. ...
In papers [3], [4], [5] Authors presented a new method of solving some kinds of computational tasks ...
The determinant of the Boolean Formulae a = {C1,…,Cm} was introduced in [1]. The present pape...
This paper presents a novel simplification calculus for propositional logic derived from Peirce’s Ex...
A simple technique for reasoning about equalities that is fast and complete for ground formulas with...
Abstract. The paper studies reductions of propositional theories in equilibrium logic to logic progr...
We overview methods of equality reasoning in sequent-based systems. We consider the history of handl...