scientific article
From MaRDI portal
Publication:2734934
zbMath0988.68183MaRDI QIDQ2734934
Marc Denecker, Victor W. Marek, Miroslaw Truszczynski
Publication date: 23 June 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algebraic semanticsfixpointsnonmonotonic logicsapproximating operatorsoperators on latticesstable fixpointswell-founded fixpoint
Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Logical aspects of lattices and related structures (03G10)
Related Items (29)
An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms ⋮ Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory ⋮ Witnesses for Answer Sets of Logic Programs ⋮ Logic programs and connectionist networks ⋮ A Formal Theory of Justifications ⋮ Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs ⋮ Connecting First-Order ASP and the Logic FO(ID) through Reducts ⋮ Safe inductions and their applications in knowledge representation ⋮ Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach ⋮ Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs ⋮ An analysis of the equational properties of the well-founded fixed point ⋮ Ultimate approximation and its application in nonmonotonic knowledge representation systems ⋮ Equational Properties of Stratified Least Fixed Points (Extended Abstract) ⋮ Grounded fixpoints and their applications in knowledge representation ⋮ Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ Fixpoint semantics for active integrity constraints ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ A compositional typed higher-order logic with definitions ⋮ Unnamed Item ⋮ Exploiting Game Theory for Analysing Justifications ⋮ Approximating operators and semantics for abstract dialectical frameworks ⋮ A fixed point theorem for non-monotonic functions ⋮ Stability, Supportedness, Minimality and Kleene Answer Set Programs ⋮ An encompassing framework for paraconsistent logic programs ⋮ Realizability of three-valued semantics for abstract dialectical frameworks ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ Uniform semantic treatment of default and autoepistemic logics
This page was built for publication:
