On computing logic programs

被引：0

作者：

Dimopoulos, Y ^{[1
]}

机构：

[1] MAX PLANCK INST INFORMAT,D-66123 SAARBRUCKEN,GERMANY

来源：

JOURNAL OF AUTOMATED REASONING | 1996年 / 17卷 / 03期

关键词：

logic programming; nonmonotonic reasoning; negation; stable models; algorithms;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper we present and compare some classical problem-solving methods for computing the stable models of logic programs with negation. Using a graph theoretic representation of logic programs and their stable models, we discuss and compare linear programming, propositional satisfiability, constraint satisfaction, and graph methods.

引用

页码：259 / 289

页数：31

共 26 条

[1]

BELL C, 1993, P INT WORKSH LOG PRO

[2]

BELL C, 1992, ACM PRINCIPLES DATAB

[3]

BENELILYAHU R, 1992, 4TH INT WORKSH NONM, P13

[4]

BENELIYAHU R, 1991, PROCEEDINGS : NINTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, P379

[5]

BENELIYAHU R, 1992, 9266 U CAL

[6]

BRASS S, 1995, LECT NOTES ARTIF INT, V927, P127

[7]

CHANG C, 1973, SYMBOLIC LOGIC MECHA

[8]

CHEN W, 1993, COMPUTATION STABLE M

[9]

CHOLEWINSKI P, 1995, P ICLP 95

[10]

Clark K. L., 1978, Logic and data bases, P293

← 1 2 3 →