Decidable Fragments of Logic Programming with Value Invention

DOI10.1007/11853886_10zbMATH Open1152.68399OpenAlexW1513258928MaRDI QIDQ3533124FDOQ3533124

Authors: Francesco Calimeri, Susanna Cozza, Giovambattista Ianni 

Publication date: 30 October 2008

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11853886_10

Recommendations

• External sources of knowledge and value invention in logic programming
• One More Decidable Class of Finitely Ground Programs
• Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes
• Complexity and undecidability results for logic programming
• Finitely recursive programs: decidability and bottom-up computation

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Cited In (2)

• External sources of knowledge and value invention in logic programming
• The expressive power of stratified logic programs with value invention

This page was built for publication: Decidable Fragments of Logic Programming with Value Invention

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