COMPUTING PERFECT AND STABLE MODELS USING ORDERED MODEL TREES
作者:
José Alberto Fernández1,
Jack Minker,
Adnan Yahya,
期刊:
Computational Intelligence
(WILEY Available online 1995)
卷期:
Volume 11,
issue 1
页码: 89-112
ISSN:0824-7935
年代: 1995
DOI:10.1111/j.1467-8640.1995.tb00024.x
出版商: Blackwell Publishing Ltd
关键词: disjunctive database;model tree;ordered model tree;perfect model;stable model
数据来源: WILEY
摘要:
Ordered model trees were introduced as a normal form for disjunctive deductive databases. They were also used to facilitate the computation of minimal models for disjunctive theories by exploiting the order imposed on the Herbrand base of the theory. In this work we show how the order on the Herbrand base can be used to compute perfect models of a disjunctive stratified finite theory. We are able to compute the stable models of a general finite theory by combining the order on the elements of the Herbrand base with previous results that had shown that the stable models of a theoryTcan be computed as the perfect models of a corresponding disjunctive theory ɛTresulting from applying the so called evidential transformation toT.While other methods consider many models that are rejected at the end, the use of atom ordering allows us to guarantee that every model generated belongs to the class of models being computed. As for negation‐free databases, the ordered tree serves as the canonical representation of the databa
点击下载:
PDF
(1299KB)
返 回