• Title of article

    Stratified resolution

  • Author/Authors

    Anatoli Degtyarev، نويسنده , , Robert Nieuwenhuis، نويسنده , , Andrei Voronkov، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2003
  • Pages
    21
  • From page
    79
  • To page
    99
  • Abstract
    We introduce a calculus of stratified resolution, in which special attention is paid to clauses that “define” relations. If such clauses are discovered in the initial set of clauses, they are treated using the rule of definition unfolding, i.e. the rule that replaces defined relations by their definitions. Stratified resolution comes with a powerful notion of redundancy: a clause to which definition unfolding has been applied can be removed from the search space. To prove the completeness of stratified resolution with redundancies, we use a novel combination of Bachmair and Ganzinger’s model construction technique and a hierarchical construction of orderings and least fixpoints.
  • Keywords
    Automated theorem proving , Ordered resolution with selection , First-order logic , Redundancy elimination , Definitionunfolding
  • Journal title
    Journal of Symbolic Computation
  • Serial Year
    2003
  • Journal title
    Journal of Symbolic Computation
  • Record number

    805710