Learning from polyhedral sets

Authors:
Salvatore Ruggieri
Affiliations:
Università di Pisa, Italy
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 9
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Geometric reasoning with logic and algebra

Artificial Intelligence - Special issue on geometric reasoning
The CLP( R ) language and system

ACM Transactions on Programming Languages and Systems (TOPLAS)
Gross motion planning—a survey

ACM Computing Surveys (CSUR)
Parameterized polyhedra and their vertices

International Journal of Parallel Programming
Combining linear programming and satisfiability solving for resource planning

The Knowledge Engineering Review
A polyhedron representation for computer vision

AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Swi-prolog

Theory and Practice of Logic Programming - Prolog Systems
A complexity perspective on entailment of parameterized linear constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parameterized linear systems allow for modelling and reasoning over classes of polyhedra. Collections of squares, rectangles, polytopes, and so on, can readily be defined by means of linear systems with parameters. In this paper, we investigate the problem of learning a parameterized linear system whose class of polyhedra includes a given set of example polyhedral sets and it is minimal.