兰州大学学报(自然科学版)
蘭州大學學報(自然科學版)
란주대학학보(자연과학판)
JOURNAL OF LANZHOU UNIVERSITY(NATURAL SCIENCES)
2000年
3期
49-55
,共7页
逻辑程序%归结耗理%模态逻辑%语义
邏輯程序%歸結耗理%模態邏輯%語義
라집정서%귀결모리%모태라집%어의
logic program%reso lution%modal logic%semantics
Baratella定义了正规谓词逻辑程序的模态完全化语义,并证明了该语义关于SLDNF- 归结的部分完备性.本文首先给出了逻辑程序的模态直承算子,并研究了相关的理论性质, 进而证明了模态完全化语义关于SLDNF-归结的完备性.
Baratella定義瞭正規謂詞邏輯程序的模態完全化語義,併證明瞭該語義關于SLDNF- 歸結的部分完備性.本文首先給齣瞭邏輯程序的模態直承算子,併研究瞭相關的理論性質, 進而證明瞭模態完全化語義關于SLDNF-歸結的完備性.
Baratella정의료정규위사라집정서적모태완전화어의,병증명료해어의관우SLDNF- 귀결적부분완비성.본문수선급출료라집정서적모태직승산자,병연구료상관적이론성질, 진이증명료모태완전화어의관우SLDNF-귀결적완비성.
Baratella proposed a kind of modal completion for normal predicate logic programs and he partly proved that SLDNF-resolution is complete with respect to his mo dal completion. In this paper,we introduce the modal form of immediate conse quence operator for logic programs and provide some interesting properties of this operator. Hence we give a direct proof for the completeness of SLDNF-res olution with respect to Baratella's completion.