Polynomially Bounded Logic Programs with Function Symbols: A New Decidable
Authors: Vernon Asuncion, Yan Zhang, Heng Zhang
AAAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | 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. |
| Researcher Affiliation | Academia | Vernon Asuncion, Yan Zhang Artificial Intelligence Research Group Western Sydney University, Australia Email:{v.asuncion, yan.zhang}@westernsydney.edu.au Heng Zhang School of Computer Science and Technology Huazhong University of Science and Technology, China Email: hengzhang@hust.edu.cn |
| Pseudocode | No | The paper provides definitions, theorems, and proofs related to logic programs, but it does not include pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any information or links regarding open-source code for the described methodology. |
| Open Datasets | No | The paper is theoretical and focuses on defining a new decidable class of logic programs. It does not involve empirical studies with datasets for training, validation, or testing. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical validation on datasets. It does not mention any training/validation/test dataset splits. |
| Hardware Specification | No | The paper is theoretical and does not describe any experimental setup or the hardware used for any computational work. |
| Software Dependencies | No | The paper mentions existing ASP solvers (e.g., Calimeri et al. 2008; Baselice, Bonatti, and Criscuolo 2009a; Alviano, Faber, and Leone 2010; Gebser, Schaub, and Thiele 2007) as background or related work, but it does not specify any software dependencies with version numbers for its own work or implementation. |
| Experiment Setup | No | The paper is theoretical and defines a new class of logic programs and its complexity. It does not describe an experimental setup with hyperparameters or system-level training settings. |