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

DOI10.1613/JAIR.1.11408MaRDI QIDQ5742242zbMATH OpenOpenAlexWikidataFDO

Authors Vernon Asuncion, Yan Zhang, Heng Zhang, Ruixuan Li

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)

Recommendations

• Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols
• On the complexity of index sets for finite predicate logic programs which allow function symbols
• Bounded linear logic: A modular approach to polynomial-time computability
• scientific article; zbMATH DE number 176206
• On the termination of logic programs with function symbols
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• The existence of universal polynomials for the class of linear functions in even-valued logics
• Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
• Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus

Cited in

(4)

• One More Decidable Class of Finitely Ground Programs
• Decidable Fragments of Logic Programming with Value Invention
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5742242)