DocumentCode
2593576
Title
Independence of selecting rule and ordering rule in PT-resolution
Author
Liu, Faye F. ; Wang, Jidong
Author_Institution
Sch. of Comput. & Inf. Sci., Univ. of South Australia, Whyalla, SA, Australia
Volume
2
fYear
1997
fDate
28-31 Oct 1997
Firstpage
1082
Abstract
Resolution with partial intersection and truncation (PT-resolution) has been introduced as a new derivation strategy in logic programming. A significant advantage of the resolution is that it prevents some derivations from infinite recursion. This paper concentrates on the independence of the selecting rule and ordering rule of PT-resolution. It is proven that a PT-derivation is independent from the selecting rule and that a PT-derivation is independent from the ordering rule
Keywords
formal logic; logic programming; programming theory; PT-resolution; derivation strategy; infinite recursion; logic programming; ordering rule; partial intersection; rule independence; selecting rule; truncation; Australia; Equations; Information science; Logic programming;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Processing Systems, 1997. ICIPS '97. 1997 IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
0-7803-4253-4
Type
conf
DOI
10.1109/ICIPS.1997.669147
Filename
669147
Link To Document