Pages that link to "Item:Q5277804"
From MaRDI portal
The following pages link to A uniform approach to constraint-solving for lists, multisets, compact lists, and sets (Q5277804):
Displaying 7 items.
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- Metalevel Algorithms for Variant Satisfiability (Q2827841) (← links)
- <i>CLP(H):</i>Constraint logic programming for hedges (Q4593022) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- (Q5087786) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
- (Q5309512) (← links)