Approximate reasoning and PT-resolution

被引：0

作者：

Liu, FF ^{[1
]}

机构：

[1] La Trobe Univ, Dept Comp Sci & Comp Engn, Bundoora, Vic 3083, Australia

来源：

2003 IEEE INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN ROBOTICS AND AUTOMATION, VOLS I-III, PROCEEDINGS | 2003年

关键词：

approximate reasoning; logic programming; PT-resolution;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper defines PT'-resolution which is the integration of PT-resolution and approximate reasoning. PT-resolution is a deduction method based on partial intersection and truncation. The integration enables the deduction to handle quantitative data in an approximate manner. It will be proved in the paper that PT'-resolution is consistent with PT-resolution.

引用

页码：609 / 613

页数：5

共 14 条

[1]

[Anonymous], P ICJAI 01 17 JOINT

[2] An effective fixpoint semantics for linear logic programs [J].

Bozzano, M ;

Delzanno, G ;

Martelli, M .

THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2002, 2 :85-122

[3] Complexity and expressive power of logic programming [J].

Dantsin, E ;

Eiter, T ;

Gottlob, G ;

Voronkov, A .

ACM COMPUTING SURVEYS, 2001, 33 (03) :374-425

[4]

Friedman N, 1996, PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, P1305

[5]

KOLLER D, 1992, PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING: PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE (KR 92), P153

[6]

LIU F, 1997, P IEEE INT C INT PRO, P1082

[7]

Liu F., 1996, P INT C GEN ALG, P66

[8]

Liu F., 1996, P 2 ECPD INT C ADV R, P92

[9]

LIU F, 1999, P IASTED INT C INT S, P9

[10] An implementation of Kripke-Kleene semantics [J].

Liu, FF ;

Moore, DH .

INFORMATION SCIENCES, 1998, 108 (1-4) :31-50

← 1 2 →