Polynomially Bounded Logic Programs with Function Symbols: A New Decidable

Authors

  • Vernon Asuncion Western Sydney University
  • Yan Zhang Western Sydney University
  • Heng Zhang Huazhong University of Science and technology

DOI:

https://doi.org/10.1609/aaai.v31i1.10669

Keywords:

Knowledge representaiton and reasoning, logic programs, stable model semantics, complexity, decidability

Abstract

A logic program with function symbols is called finitely ground if there is a finite propositional logic program whose stable models are exactly the same as the stable models of this program. Finite groundability is an important property for logic programs with function symbols because it makes feasible to compute such program’s stable models using traditional ASP solvers. In this paper, we introduce a new decidable class of finitely ground programs called POLY-bounded programs, which, to the best of our knowledge, strictly contains all decidable classes of finitely ground programs discovered so far in the literature. We also study the related complexity property for this class of programs. We prove that deciding whether a program is POLY-bounded is EXPTIMEcomplete.

AAAI-2017 Proceedings Cover

Downloads

Published

2017-02-12

How to Cite

Asuncion, V., Zhang, Y., & Zhang, H. (2017). Polynomially Bounded Logic Programs with Function Symbols: A New Decidable. Proceedings of the AAAI Conference on Artificial Intelligence, 31(1). https://doi.org/10.1609/aaai.v31i1.10669

Issue

Vol. 31 No. 1 (2017): Thirty-First AAAI Conference on Artificial Intelligence

Section

AAAI Technical Track: Knowledge Representation and Reasoning