A uniform approach to constraint-solving for lists, multisets, compact lists, and sets

DOI10.1145/1352582.1352583zbMath1367.68079arXivcs/0309045OpenAlexW2029740449WikidataQ57840340 ScholiaQ57840340MaRDI QIDQ5277804

Gianfranco Rossi, Carla Piazza, Agostino Dovier

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0309045

zbMATH Keywords

setsmultisetslistscompact listsmembership and equality constraints

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (6)

CLP(H):Constraint logic programming for hedges ⋮ Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages ⋮ Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* ⋮ Unnamed Item ⋮ Variant-Based Satisfiability in Initial Algebras ⋮ Metalevel Algorithms for Variant Satisfiability

This page was built for publication: A uniform approach to constraint-solving for lists, multisets, compact lists, and sets