P. Baumgartner and S. Bruning, A disjunctive positive refinement of model elimination and its application to subsumption deletion, J. Automated Reasoning 19 (1997) 205-262. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Completeness of Pruning Methods for Consequence Finding.. - Iwanuma, Inoue, Satoh (2000) (1 citation) (Correct)
....The identical C reduction is a restricted C reduction [18] with empty substitution. Both identical reductions are clearly mandatory rules. 5. 3 Subsumption A lot of work on subsumption has been carried out to avoid logical redundancies in connection tableaux or model elimination like calculi [2, 12]. Almost all of them are compatible with SOL tableau calculus. 2 The subgoal tree of of a tableau T is the ordered tree obtained from T by deleting all solved subtableaux and their in going edges. 97 Unit Subsumption: Unit subsumption is the simplest form of so called subsumptionfreeness ....
....T is properly subsumed by a unit clause of the input set Sigma . Unit subsumption can dynamically be executed with quite little run time overhead [11] and hence is valuable. In SOL tableaux, this rule is also complete for P rod( Sigma; C; P; OE) Tableau Context Check: The tableau context check [2] is a subsumption method which only investigates, for pruning, previously derivated tableaux in the deduction sequence up to the current stage. If we weaken the regularity condition for tableaux to the blockwise regularity [2] then we can impose the tableau contextcheck condition onto SOL ....
[Article contains additional citation context not shown here]
P. Baumgartner and S. Bruning, A disjunctive positive refinement of model elimination and its application to subsumption deletion, J. Automated Reasoning 19 (1997) 205-262.
A Taxonomy of Parallel Strategies for Deduction - Bonacina (1999) (Correct)
....subgoal reduction components (e.g. 57, 40, 41] Furthermore, it seems that in order to be fair a distributed search subgoal reduction strategy would need to generate and accumulate tableaux, that is, it should adopt a best first, rather than depth first, plan. A similar experience was made in [9] for contraction, where the idea of applying subsumption among tableaux assume that more than one tableau is generated and kept. We recall that the analysis of [21] suggested that while subgoal reduction strategies may be amenable to all three types of parallelism (term level, clause level and ....
Peter Baumgartner and Stefan Bruning. A disjunctive positive refinement of model elimination and its application to subsumption deletion. Journal of Automated Reasoning, 19:205--262, 1997.
Answer Synthesis for CLP Programs with Negation - Richard, Saubion (1997) (1 citation) (Correct)
No context found.
P. Baumgartner and S. Bruning. A Disjunctive Positive Refinement of Model Elimination and its Application to Subsumption Deletion. Technical Report 6-95, University of Koblenz, Germany, 1995.
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