MUNCH - Automated Reasoner for Sets and Multisets

This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multisets, and integers. Constraints over collections and integers are connected using the cardinality operator. Our logic is a fragment of logics of popular interactive theorem provers, and MUNCH is the first fully automated reasoner for this logic. MUNCH reduces input formulas to equisatisfiable linear integer arithmetic formulas. MUNCH reasoner is publicly available. It is implemented in the Scala programming language and currently uses the SMT solver Z3 to solve the generated integer linear arithmetic constraints.


Editor(s):
Giesl, Juergen
Haehnle, Reiner
Published in:
Proceedings of the 5th International Joint Conference on Automated Reasoning, 149-155
Presented at:
International Joint Conference on Automated Reasoning, Edinburgh, UK, July 16-19, 2010
Year:
2010
Publisher:
Springer
Keywords:
Laboratories:




 Record created 2010-12-01, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)