Nieuwhenhuis R., Rubio A., Paramodulation-Based Theorem Proving, in Robinson A., Voronkov A., (eds.) "Handbook of Automated Reasoning", vol. I, Elsevier/MIT, pp. 371533 (2001). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Stratified Resolution - Degtyarev, Nieuwenhuis, Voronkov (2000) (Correct)
.... headed with the same symbol, which can be ordered in any way by as long as is well founded) In a practical prover usually general purpose orderings like the Knuth Bendix ordering (KBO) or the lexicographic or recursive path ordering (LPO or RPO) can be used for ordering such Q atoms (see e.g. [Niewenhuis and Rubio 2000] for precise definitions) In practice, for selection functions on nonground clauses (and, as we will see, for restricting more the nonground inference rules) it will be useful to be able to approximate on the nonground level, that is, to check, for nonground Q atoms Q and Q 0 , whether there ....
.... where one requires only Doe C, cannot be handled by the redundancy notions defined up to now; for example, the unit clause r(a) is not redundant by these definitions in the presence of the unit clause r(x) This can again be solved by well known techniques (see [Bachmair and Ganzinger 2000, Niewenhuis and Rubio 2000]) which we do not want to treat in detail here. Let us only mention one possibility: compare ground instances Aoe and B of atoms (or clauses) A and B by an ordering pair on pairs defined by: A; oe) pair (B; if either Aoe B or else Aoe j B and A is an instance of B but not vice versa. ....
Niewenhuis R. and Rubio A. [2000], Paramodulation-based theorem proving, in A. Robinson and A. Voronkov, eds, `Handbook of Automated Reasoning', Elsevier Science and MIT Press. To appear.
Reasoners' Cooperation and Quantifier Elimination - Ghilardi (2003) (Correct)
No context found.
Nieuwhenhuis R., Rubio A., Paramodulation-Based Theorem Proving, in Robinson A., Voronkov A., (eds.) "Handbook of Automated Reasoning", vol. I, Elsevier/MIT, pp. 371533 (2001).
Model-Theoretic Methods in Combined Constraint Satisfiability - Ghilardi (2004) (1 citation) (Correct)
No context found.
Nieuwhenhuis R., Rubio A., Paramodulation-Based Theorem Proving, in Robinson A., Voronkov A., (eds.) "Handbook of Automated Reasoning", vol. I, Elsevier/MIT, pp.371-533, (2001).
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