2012
Conference article
Restricted
Computational complexities of inclusion queries over polyhedral sets
Eirinakis P., Ruggieri S., Subramani K., Wojciechowski P.
Entailment Parameterized linear constraint Quantified linear implication
In this paper we discuss the computational complexities of procedures for inclusion queries over polyhedral sets. The polyhedral sets that we consider occur in a wide range of applications, ranging from logistics to program verification. The goal of our study is to establish boundaries between hard and easy problems in this context.
Source: International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, FL, USA, 9-11 January 2012
Back to previous page
BibTeX entry
@inproceedings{oai:it.cnr:prodotti:276082,
title = {Computational complexities of inclusion queries over polyhedral sets},
author = {Eirinakis P. and Ruggieri S. and Subramani K. and Wojciechowski P.},
booktitle = {International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, FL, USA, 9-11 January 2012},
year = {2012}
}CNR authorsLaboratories
0000-0002-1917-6087