Editing Epistemic Foundation of Stable Model Semantics

Title: Epistemic Foundation of Stable Model Semantics

Research Question: How can stable model semantics be defined and characterized in an epistemic framework, and what are the implications of this approach?

Methodology: The authors propose an alternative and epistemic-based characterization of stable model semantics, which is based on monotone operators over bilattices. This approach is purely algebraic and can abstract from the particular formalism of choice.

Results: The authors show that stable model semantics can be deﬁned as an extension of the Kripke-Kleene semantics. They also demonstrate that the closed world assumption can be seen as an additional source of 'falsehood' to be added cumulatively to the Kripke-Kleene semantics.

Implications: This epistemic approach to stable model semantics provides a more intuitive understanding of the semantics and can potentially lead to more efficient algorithms for reasoning with logic programs. Additionally, the ability to represent incomplete and inconsistent information in a four-valued semantics opens up new possibilities for knowledge representation and reasoning.

Link to Article: https://arxiv.org/abs/0403002v2
Authors: 
arXiv ID: 0403002v2

[[Category:Computer Science]]
[[Category:Semantics]]
[[Category:Stable]]
[[Category:Model]]
[[Category:Can]]
[[Category:Epistemic]]