Ultimate approximation and its application in nonmonotonic knowledge representation systems
type: Item
instance of: scholarly article
title: Ultimate approximation and its application in nonmonotonic knowledge representation systems
zbMATH Open document ID: 1074.68069
author: Marc Denecker
author: Wiktor Marek
author: Mirosław Truszczyński
published in: Information and Computation
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 2083160
zbMATH Keywords: Knowledge representation
zbMATH Keywords: Bilattices
zbMATH Keywords: Approximation
MaRDI profile type: Publication
full work available at URL: j.ic.2004.02.004
OpenAlex ID: W2145648043
cites work: Contributions to the Theory of Logic Programming
cites work: Dualities between alternative semantics for logic programming and nonmonotonic reasoning
cites work: Q4246955
cites work: Q4934646
cites work: Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
cites work: Logic programming revisited
cites work: Uniform semantic treatment of default and autoepistemic logics
cites work: Q4736514
cites work: A kripke-kleene semantics for logic programs*
cites work: Bilattices and the semantics of logic programming
cites work: Fixpoint semantics for logic programming a survey
cites work: On the relation between default and autoepistemic logic
cites work: Negation in logic programming
cites work: Chain-complete posets and directed sets with applications
cites work: Autoepistemic logic
cites work: Q3486858
cites work: A logic for default reasoning
cites work: A lattice-theoretical fixpoint theorem and its applications
cites work: The alternating fixpoint of logic programs with negation
cites work: The Semantics of Predicate Logic as a Programming Language
cites work: The well-founded semantics for general logic programs
DOI: 10.1016/J.IC.2004.02.004
description: scientific article; zbMATH DE number 2083160