Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes

DOI10.1613/JAIR.1.11408zbMath1489.68049OpenAlexW2931130662WikidataQ115512396 ScholiaQ115512396MaRDI QIDQ5742242

Vernon Asuncion, Heng Zhang, Ruixuan Li, Yan Zhang

Publication date: 17 May 2019

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11408

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes