Theory and Practice of Logic Programming · 2005 · 33 citations · 7 references
ComputingComputer ScienceMathematicsAlgorithmsComputational GeometryProgramming LanguagesConstraint ProgrammingConstraint SatisfactionConstraint SolvingConvex HullsLinear ProgrammingLogic ProgrammingConstraint Logic ProgrammingConvex Hull AlgorithmsPolyhedral AnalysisPolyhedral Convex HullsPolyhedral TheoryProgramming Concepts
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be coded with linear constraint solving machinery that is available in many Prolog systems.
7
Automatic discovery of linear restraints among variables of a program
Patrick Cousot, Nicolas Halbwachs · 1978 · 1.6K citations