Finitely recursive programs: decidability and bottom-up computation

MaRDI QIDQ2880785zbMATH OpenFDO

Authors Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, N. Leone

Publication date 16 April 2012

Published in AI Communications (Search for Journal in Brave)

Full work available at URL http://iospress.metapress.com/content/el20u83422223807/fulltext.html

zbMATH Keywords

answer set programmingknowledge representationfunction symbolsmagic sets

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Recommendations

• Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
• Disjunctive ASP with functions: decidable queries and effective computation
• Computable Functions in ASP: Theory and Implementation
• On Finitely Recursive Programs
• scientific article; zbMATH DE number 6139984

Cited in

(20)

• A semantics for probabilistic hybrid knowledge bases with function symbols
• One More Decidable Class of Finitely Ground Programs
• FDNC: decidable nonmonotonic disjunctive logic programs with function symbols
• Computable Functions in ASP: Theory and Implementation
• Disjunctive ASP with functions: decidable queries and effective computation
• A decidable subclass of finitary programs
• On Finitely Recursive Programs
• Logic programming with function symbols: checking termination of bottom-up evaluation through program adornments
• {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
• scientific article; zbMATH DE number 680708 (Why is no real title available?)
• Composing Normal Programs with Function Symbols
• On finitely recursive programs
• The decidable properties of subrecursive functions
• scientific article; zbMATH DE number 598180 (Why is no real title available?)
• ASP-Core-2 input language format
• Decidable Fragments of Logic Programming with Value Invention
• Decidable problems for powerful programs
• Terminating evaluation of logic programs with finite three-valued models
• scientific article; zbMATH DE number 65747 (Why is no real title available?)
• Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs

This page was built for publication: Finitely recursive programs: decidability and bottom-up computation

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