| H. Ganzinger, Th. Hillenbrand, and U. Waldmann. Superposition modulo a Shostak theory. In F. Baader, editor, Automated Deduction (CADE-19), volume 2741 of LNAI, pages 182-196. Springer-Verlag, 2003. |
....approach are reached, and further information on the internals of the canonizer and the solver is required in order to keep the inferences nitely branching. In this paper we can only give an overview of the main ideas behind our work. For a more detailed treatment, please see the full version [GHW03]. 2 Preliminaries For most logical notions and notations, we refer to [NR01] In particular, we work in a logic with built in equality and assume without loss of generality that equality is the only predicate symbol. For simplicity of notation the equality symbol is supposed to be symmetric. A ....
H. Ganzinger, Th. Hillenbrand, and U. Waldmann. Superposition modulo a Shostak theory. Technical report, Max-Planck-Institut fur Informatik, Saarbrucken, 2003.
No context found.
H. Ganzinger, Th. Hillenbrand, and U. Waldmann. Superposition modulo a Shostak theory. In F. Baader, editor, Automated Deduction (CADE-19), volume 2741 of LNAI, pages 182-196. Springer-Verlag, 2003.
No context found.
Harald Ganzinger, Thomas Hillenbrand, and Uwe Waldmann. Superposition modulo a Shostak theory. In Franz Baader, editor, Automated Deduction -- CADE-19, volume 2741 of Lecture Notes in Computer Science, pages 182--196. Springer, 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC