Well-Supported semantics for logic programs with generalized rules

Authors:
Jia-Huai You;Yi-Dong Shen;Kewen Wang
Affiliations:
Department of Computing Science, University of Alberta, Canada;State Key Laboratory of Computer Science, Chinese Academy of Sciences, China;School of Computing and Information Technology, Griffith University, Australia
Venue:
Correct Reasoning
Year:
2012

Citing 23
Cited 0

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Nested expressions in logic programs

Annals of Mathematics and Artificial Intelligence
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Ultimate approximation and its application in nonmonotonic knowledge representation systems

Information and Computation
A Constructive semantic characterization of aggregates in answer set programming

Theory and Practice of Logic Programming
Well-founded and stable semantics of logic programs with aggregates

Theory and Practice of Logic Programming
Combining answer set programming with description logics for the Semantic Web

Artificial Intelligence
Twelve Definitions of a Stable Model

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Lparse Programs Revisited: Semantics and Representation of Aggregates

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A Default Approach to Semantics of Logic Programs with Constraint Atoms

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Answer sets for logic programs with arbitrary abstract constraint atoms

Journal of Artificial Intelligence Research
Modal interpretations of default logic

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A uniform integration of higher-order reasoning and external evaluations in answer-set programming

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Declarative and computational properties of logic programs with aggregates

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Logic programs with abstract constraints: representaton, disjunction and complexities

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs

Artificial Intelligence
dl2asp: implementing default logic via answer set programming

JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Stable models and circumscription

Artificial Intelligence
Semantics and complexity of recursive aggregates in answer set programming

Artificial Intelligence
Answer sets for propositional theories

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
First-order extension of the FLP stable model semantics via modified circumscription

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Well-supported semantics for description logic programs

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two

Quantified Score

Hi-index	0.00

Visualization

Abstract

Logic programming under the stable model semantics has been extended to arbitrary formulas. A question of interest is how to characterize the property of well-supportedness, in the sense of Fages, which has been considered a cornerstone in answer set programming. In this paper, we address this issue by considering general logic programs, which consist of disjunctive rules with arbitrary propositional formulas in rule bodies. We define the justified stable semantics for these programs, propose a general notion of well-supportedness, and show the relationships between the two. We address the issue of computational complexity for various classes of general programs. Finally, we show that previously proposed well-supported semantics for aggregate programs and description logic programs are rooted in the justified stable semantics of general programs.