@inproceedings{fe997241bf01408887c09b7ff7bbba6e,
title = "Constrained regular approximation of logic programs",
abstract = "Regular approximation is a well-known and useful analysis technique for conventional logic programming. Given the existence of constraint solving techniques, one may wish to obtain more precise approximations of programs while retaining the decidable properties of the approximation. Greater precision could increase the eectiveness of applications that make use of regular approximation, such as the detection of useless clauses and type analysis. In this paper, we introduce arithmetic constraints, based on convex polyhedra, into regular approximation. In addition, Herbrand constraints can be introduced to capture dependencies among arguments.",
keywords = "Convex polyhedra, Linear constraints, Regular approximation, Convex polyhedra, Linear constraints, Regular approximation",
author = "H{\"u}seyin Sağlam and Gallagher, {John P.}",
year = "1998",
doi = "10.1007/3-540-49674-2_15",
language = "English",
isbn = "3540650741",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "282--299",
editor = "Fuchs, {Norbert E.}",
booktitle = "Logic Program Synthesis and Transformation",
note = "7th International Workshop on Logic Program Synthesis and Transformation, LOPSTR 1997 ; Conference date: 10-07-1997 Through 12-07-1997",
}