• DocumentCode
    3312303
  • Title

    The Set of Support strategy in temporal resolution

  • Author

    Dixon, Clare ; Fisher, Michael

  • Author_Institution
    Dept. of Comput. & Math., Manchester Metro. Univ., UK
  • fYear
    1998
  • fDate
    16-17 May 1998
  • Firstpage
    113
  • Lastpage
    120
  • Abstract
    A variety of proof methods have been developed to support the effective mechanisation of temporal logic. While clausal temporal resolution has been successfully employed for a range of problems, a number of improvements are still required. In particular, as there is no consistent control strategy underlying the method, and a large amount of irrelevant information may sometimes be generated. Following on from classical resolution, where the `Set of Support´ strategy has been used very successfully, we introduce, justify and apply a temporal version of this strategy, thus allowing the supporting set to be carried over between the different phases of the resolution method. This not only restricts the production of irrelevant information but, under certain conditions, retains the completeness of the refutation process
  • Keywords
    heuristic programming; temporal logic; temporal reasoning; theorem proving; Set of Support strategy; clausal temporal resolution; control strategy; heuristics; irrelevant information generation; proof methods; propositional temporal logic; refutation process completeness; resolution method phases; supporting set; temporal logic mechanisation; temporal theorem proving; Database languages; Logic programming; Mathematics; Production;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Temporal Representation and Reasoning, 1998. Proceedings. Fifth International Workshop on
  • Conference_Location
    Sanibel Island, FL
  • Print_ISBN
    0-8186-8473-9
  • Type

    conf

  • DOI
    10.1109/TIME.1998.674140
  • Filename
    674140