Ordering default theories and nonmonotonic logic programs
type: Item
instance of: scholarly article
title: Ordering default theories and nonmonotonic logic programs
zbMATH Open document ID: 1076.68075
author: Chiaki Sakama
published in: Theoretical Computer Science
publication date: 2005-06-30T00:00:00Z
review text: A default theory contains different portions of information: classical/persistent and default/ten\-ta\-tive. These different portions are used in the paper to order default theories. The default theories are characterised by means of a bilattice-based many-valued interpretation having two orderings: information content ordering and truth ordering. When \(Th_1\leq_{DL} Th_2\), conclusions derived from \(Th_1\) are relatively less certain than those derived from \(Th_2\). Such an order \(\leq_{DL}\) is nonmonotonic w.r.t. the increase of information. This allows the author to study ordering relations in the answer-set semantics for nonmonotonic logic programs having many-valued interpretations (for this topic see also the influential paper by \textit{M. Gelfond} and \textit{V. Lifschitz} [New Gener. Comput. 9, No. 3/4, 365--385 (1991; Zbl 0735.68012)]).
reviewed by: Vladimir Komendantsky
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 03B50
Mathematics Subject Classification ID: 03B60
zbMATH DE Number: 2184037
zbMATH Keywords: default theories
zbMATH Keywords: nonmonotonic logic programs
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.12.003
OpenAlex ID: W2094463551
cites work: On the correctness of unfold/fold transformation of normal and extended logic programs
cites work: Logic programming and knowledge representation
cites work: Q3206928
cites work: Q4236380
cites work: Bilattices and the semantics of logic programming
cites work: Q3983043
cites work: Complexity Results for Nonmonotonic Logics
cites work: Strongly equivalent logic programs
cites work: Autoepistemic logic
cites work: Foundations of inductive logic programming
cites work: A logic for default reasoning
cites work: Q4843187
cites work: Q4800160
cites work: Induction from answer sets in nonmonotonic logic programs
cites work: Paraconsistent Stable Semantics for Extended Disjunctive Programs
cites work: Q4799292
DOI: 10.1016/J.TCS.2004.12.003
description: scientific article; zbMATH DE number 2184037