• DocumentCode
    1716868
  • Title

    PT(CP)-resolution

  • Author

    Liu, Faye F.

  • Author_Institution
    Dept. of Comput. Sci., R. Melbourne Inst. of Technol., Vic., Australia
  • Volume
    2
  • fYear
    2001
  • Firstpage
    1039
  • Abstract
    This paper presents the framework of PT(CP)-resolution which is the unification of PT-resolution and conditional proof. PT-resolution is resolution with partial intersection and truncation. The paper analyses the necessity, feasibility and also limitations of this unification and formulates PT(CP)-resolution. PT(CP)-resolution is regarded as an improved version of PT-resolution. It resumes its derivation when the derivation is terminated before the query is answered.
  • Keywords
    logic programming; PT(CP)-resolution; PT-resolution; conditional proof; partial intersection; truncation; Australia; Computer science; Equations; Logic programming; Resumes; Sparks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Fuzzy Systems, 2001. The 10th IEEE International Conference on
  • Print_ISBN
    0-7803-7293-X
  • Type

    conf

  • DOI
    10.1109/FUZZ.2001.1009141
  • Filename
    1009141
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1716868