The following pages link to (Q4385449):
Displaying 8 items.
- Interval propagation to reason about sets: Definition and implementation of a practical language (Q679421) (← links)
- Set constraints and logic programming (Q1271565) (← links)
- Knowledge-based proof planning (Q1978469) (← links)
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- {log}: A language for programming in logic with finite sets (Q3129506) (← links)
- (Q4944863) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
- Constructive negation and constraint logic programming with sets (Q5945160) (← links)