Computing Convex Hulls with a Linear Solver
Florence Benoy, Andy King, Fred Mesnard
TL;DR
This paper presents a method for computing convex hulls using linear constraint solving, facilitating polyhedral analysis in logic programming with existing Prolog systems.
Contribution
It introduces a programming tactic that leverages linear solvers for convex hull computations in polyhedral analysis, enhancing logic programming tools.
Findings
Enables convex hull computation via linear constraint solvers
Integrates polyhedral analysis into Prolog systems
Improves efficiency of polyhedral analysis in logic programming
Abstract
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. To appear in Theory and Practice of Logic Programming (TPLP)
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Logic, programming, and type systems · Logic, Reasoning, and Knowledge