On Finitely Recursive Programs

DOI10.1007/978-3-540-74610-2_7zbMATH Open1213.68170OpenAlexW2937456179MaRDI QIDQ3608648FDOQ3608648

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

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

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (15)

• Title not available (Why is that?)
• Finitely recursive programs: decidability and bottom-up computation
• One More Decidable Class of Finitely Ground Programs
• Computable Functions in ASP: Theory and Implementation
• Locally determined logic programs and recursive stable models
• Answer Set Programming: A Primer
• Reasoning with infinite stable models
• A decidable subclass of finitary programs
• Composing Normal Programs with Function Symbols
• Title not available (Why is that?)
• On finitely recursive programs
• Title not available (Why is that?)
• Weight constraint programs with evaluable functions
• Title not available (Why is that?)
• $\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)