PARTIAL DEDUCTION OF LOGIC PROGRAMS WRT WELL-FOUNDED SEMANTICS

被引：0

作者：

ARAVINDAN, C

DUNG, PM

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1992年 / 632卷

关键词：

PARTIAL DEDUCTION; PROGRAM TRANSFORMATION; WELL-FOUNDED NEGATION;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In this paper, we extend the partial deduction framework of [LS] to unfold non-ground negative literals [ST,CW] and to include loop checks [B2] during partial deduction. We show that the unified framework is sound and complete wrt well-founded model semantics, when certain conditions are satisfied.

引用

页码：384 / 402

页数：19

共 50 条

[21] Ambiguity propagating defeasible logic and the well-founded semantics
Maier, Frederick
Nute, Donald
[J]. LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4160 : 306 - 318
[22] Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies
Chowdhury, Md. Solimul
Liu, Fangfang
Chen, Wu
Karimi, Arash
You, Jia-Huai
[J]. LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION (LOPSTR 2014), 2015, 8981 : 279 - 296
[23] A connection between the Cantor–Bendixson derivative and the well-founded semantics of finite logic programs
Douglas Cenzer
Jeffrey B. Remmel
[J]. Annals of Mathematics and Artificial Intelligence, 2012, 65 : 1 - 24
[24] SOUNDNESS AND COMPLETENESS OF PARTIAL DEDUCTIONS FOR WELL-FOUNDED SEMANTICS
PRZYMUSINSKA, H
PRZYMUSINSKI, T
SEKI, H
[J]. LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 624 : 1 - 12
[25] Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
Charalambidis, Angelos
Rondogiannis, Panos
Symeonidou, Ioanna
[J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2018, 18 (3-4) : 421 - 437
[26] Well-Founded and Partial Stable Semantics Logical Aspects
Cabalar, Pedro
Odintsov, Sergei
Pearce, David
[J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2009, 5675 : 1 - +
[27] WELL-FOUNDED SEMANTICS AND STABLE SEMANTICS OF SEMI-STRICT PROGRAMS
GIRE, F
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 646 : 261 - 275
[28] Interdefinability of defeasible logic and logic programming under the well-founded semantics
Maier, Frederick
[J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2013, 13 : 107 - 142
[29] A NONDETERMINISTIC WELL-FOUNDED SEMANTICS
TORRES, A
[J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1995, 14 (01) : 37 - 73
[30] A tutorial on the well-founded semantics
Van Gelder, A
[J]. PROGRAMMING AND COMPUTER SOFTWARE, 1998, 24 (01) : 32 - 42

← 1 2 3 4 5 →