On Finitely Recursive Programs

DOI10.1007/978-3-540-74610-2_7MaRDI QIDQ3608648zbMATH OpenOpenAlexFDO

Authors Sabrina Baselice, Giovanni Criscuolo, P. A. Bonatti

Publication date 5 March 2009

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74610-2_7

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• On finitely recursive programs
• Reasoning with infinite stable models
• scientific article; zbMATH DE number 2090537
• Finitely recursive programs: decidability and bottom-up computation
• Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs

Cited in

(15)

• scientific article; zbMATH DE number 2090537 (Why is no real title available?)
• Finitely recursive programs: decidability and bottom-up computation
• One More Decidable Class of Finitely Ground Programs
• Locally determined logic programs and recursive stable models
• Computable Functions in ASP: Theory and Implementation
• Reasoning with infinite stable models
• Answer Set Programming: A Primer
• A decidable subclass of finitary programs
• scientific article; zbMATH DE number 680708 (Why is no real title available?)
• Composing Normal Programs with Function Symbols
• On finitely recursive programs
• scientific article; zbMATH DE number 598180 (Why is no real title available?)
• Weight constraint programs with evaluable functions
• scientific article; zbMATH DE number 3936483 (Why is no real title available?)
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols

This page was built for publication: On Finitely Recursive Programs

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