dc.creatorCristía, Maximiliano
dc.creatorRossi, Gianfranco
dc.date2022-10
dc.date2022
dc.date2023-04-18T15:31:32Z
dc.date.accessioned2023-07-15T10:11:52Z
dc.date.available2023-07-15T10:11:52Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/151644
dc.identifierhttps://publicaciones.sadio.org.ar/index.php/JAIIO/article/download/302/251
dc.identifierissn:2451-7496
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7490953
dc.descriptionFormal reasoning about finite sets and cardinality is important for many applications, including software verification, where very often one needs to reason about the size of a given data structure. The Constraint Logic Programming tool {log} (‘setlog’) provides a decision procedure for deciding the satisfiability of formulas involving very general forms of finite sets, although it does not provide cardinality constraints. In this paper we adapt and integrate a decision procedure for a theory of finite sets with cardinality into {log}. The proposed solver is proved to be a decision procedure for its formulas. Besides, the new CLP instance is implemented as part of the {log} tool. In turn, the implementation uses Howe and King’s Prolog SAT solver and Prolog’s CLP(Q) library, as an integer linear programming solver. The empirical evaluation of this implementation based on +250 real verification conditions shows that it can be useful in practice.
dc.descriptionSociedad Argentina de Informática e Investigación Operativa
dc.formatapplication/pdf
dc.format70-70
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.subjectCiencias Informáticas
dc.subjectConstraint Logic Programming tool
dc.subjectTheory of finite sets
dc.titleIntegrating cardinality constraints into constraint logic programming with sets
dc.typeObjeto de conferencia
dc.typeResumen


Este ítem pertenece a la siguiente institución