Approximating any logic program by a CS-program

DOI10.1007/978-3-319-99840-4_14MaRDI QIDQ6164543zbMATH OpenOpenAlexFDO

Authors Yohan Boichut, Vivien Pelletier, Pierre Réty

Publication date 28 July 2023

Published in Rewriting Logic and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99840-4_14

zbMATH Keywords

approximationCS-programlogic program transformationreachability problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Transformations of logic programs
• Transformations of logic programs
• Basic rewriting via logic programming, with an application to the reachability problem
• A computable semantics for general logic programs
• The transformational approach to program development

This page was built for publication: Approximating any logic program by a CS-program

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