On the Complexity of Perfect Models of Logic Programs

Authors:
Sergey M. Dudakov
Affiliations:
(Correspd.) Dept. of CS, Tver State Univ., 33 Zhelyabova str., Tver, 170013, Russia. p000104@tversu.ru
Venue:
Fundamenta Informaticae
Year:
1999

Citing 4
Cited 0

Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
Logic programming

Handbook of theoretical computer science (vol. B)
Autoepistemic logic

Journal of the ACM (JACM)
Nonmonotonic Logic: Context-Dependent Reasoning

Nonmonotonic Logic: Context-Dependent Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate computational complexity of the PERF-consistency and PERF-entailment problems for ground normal logic programs. In [3] it is proved that these problems belong to Σ 2 P and II 2 P correspondingly. The question of obtaining more accurate results was left as open. We prove that both problems belong to Δ 2 P. Lower bounds on the complexity of these problems are also established in terms of a new complexity class D 2 which is a subset of Δ 2 P. It is shown that PERF-consistency is a D 2-complete problem and PERF-entailment is co-D 2-complete.