Approximating any logic program by a CS-program

DOI10.1007/978-3-319-99840-4_14zbMath1517.68138OpenAlexW2889563233MaRDI QIDQ6164543

Pierre Réty, Vivien Pelletier, Yohan Boichut

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

approximationreachability problemlogic program transformationCS-program

Mathematics Subject Classification ID

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

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