From answer set logic programming to circumscription via logic of GK

Authors:
Fangzhen Lin;Yi Zhou
Affiliations:
Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 12
Cited 11

Semantical considerations on nonmonotonic logic

Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge

Artificial Intelligence
A logic of knowledge and justified assumptions

Artificial Intelligence
Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
The Logic Programming Paradigm: A 25-Year Perspective

The Logic Programming Paradigm: A 25-Year Perspective
Nested expressions in logic programs

Annals of Mathematics and Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
A New Logical Characterisation of Stable Models and Answer Sets

NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
A new perspective on stable models

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Discovering classes of strongly equivalent logic programs

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Answer sets for propositional theories

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning

Twelve Definitions of a Stable Model

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Comparison of semantics of disjunctive logic programs based on model-equivalent reduction

Journal of Computer Science and Technology
A First Order Forward Chaining Approach for Answer Set Computing

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
The modal logic S4F, the default logic, and the logic here-and-there

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A new perspective on stable models

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Circumscriptive event calculus as answer set programming

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
General default logic

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
General default logic

Annals of Mathematics and Artificial Intelligence
Stable models and circumscription

Artificial Intelligence
Loop-separable programs and their first-order definability

Artificial Intelligence
Thirteen definitions of a stable model

Fields of logic and computation

Quantified Score

Hi-index	0.03

Visualization

Abstract

We first provide a mapping from Pearce's equilibrium logic and Ferraris's general logic programs to Lin and Shoham's logic of knowledge and justified assumptions, a nonmonotonic modal logic that has been shown to include as special cases both Reiter's default logic in the propositional case and Moore's autoepistemic logic. From this mapping, we obtain a mapping from general logic programs to circumscription, both in the propositional and first-order case. Furthermore, we show that this mapping can be used to check the strong equivalence between two propositional logic programs in classical logic.