Convex hull abstractions in specialization of CLP programs

DOI10.1007/3-540-45013-0_8zbMATH Open1278.68052OpenAlexW2128709994MaRDI QIDQ3079923FDOQ3079923

Authors: Julio C. Peralta, John P. Gallagher 

Publication date: 4 March 2011

Published in: Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45013-0_8

Recommendations

• scientific article; zbMATH DE number 1615255
• scientific article; zbMATH DE number 1973221
• Computing convex hulls with a linear solver
• Specialisation of Prolog and FCP programs using abstract interpretation
• scientific article; zbMATH DE number 1497831

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Cited In (7)

• Analysis of Linear Hybrid Systems in CLP
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• Computing convex hulls with a linear solver
• Using real relaxations during program specialization
• Title not available (Why is that?)
• Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification
• Program specialization for verifying infinite state systems: an experimental evaluation

Uses Software

• ECCE

This page was built for publication: Convex hull abstractions in specialization of CLP programs

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