Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Journal of the ACM (JACM)
Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
A new research into default logic
Information and Computation
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Answer set programming and plan generation
Artificial Intelligence
Fixed-parameter complexity in AI and nonmonotonic reasoning
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
On odd and even cycles in normal logic programs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
| Hi-index | 0.00 |
Marek's forward-chaining construction is one of the important techniques for investigating the nonmonotonic reasoning. By introduction of consistency property over a logic program, they proposed a class of logic programs, FC-normal programs, each of which has at least one stable model. However, it is not clear how to choose one appropriate consistency property for deciding whether or not a logic program is FC-normal. In this paper, we firstly discover that, for any finite logic program Π, there exists the least consistency property LCon(Π) over Π, which just depends on Π itself, such that, Π is FC-normal if and only if Π is FC-normal with respect to (w.r.t.) LCon(Π). Actually, in order to determine the FC-normality of a logic program, it is sufficient to check the monotonic closed sets in LCon(Π) for all non-monotonic rules, that is LFC(Π). Secondly, we present an algorithm for computing LFC(Π). Finally, we reveal that the brave reasoning task and cautious reasoning task for FC-normal logic programs are of the same difficulty as that of normal logic programs.