A GRAPH-THEORETIC APPROACH TO DEFAULT LOGIC

被引：15
|
作者：
DIMOPOULOS, Y
MAGIROU, V
机构：
[1] Department of Informatics, Athens University of Economics and Business, Athens 104 34
[2] Max-Planck-Institut für Informatik, 66123 Saarbrücken, Im Stadtwald
来源：
INFORMATION AND COMPUTATION | 1994年 / 112卷 / 02期
关键词：
D O I：
10.1006/inco.1994.1058
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A network representation of propositional seminormal disjunction-free default theories is presented, leading to a graph-theoretic approach to their analysis. The problem of finding an extension is proved to be equivalent to that of determining a kernel for a corresponding graph, allowing stronger complexity results as well as new conditions for the existence of extensions. (C) 1994 Academic Press, Inc.
引用
下载
收藏
页码：239 / 256
页数：18
相关论文
共 50 条
12345