Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Tableau Calculus for Integrating First-Order and Elementary Set Theory Reasoning
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Decision Problems for Tarski and Presburger Arithmetics Extended With Sets
CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
Journal of Automated Reasoning
Efficient theory combination via boolean search
Information and Computation - Special issue: Combining logical systems
Decision procedures for term algebras with integer constraints
Information and Computation - Special issue: Combining logical systems
Annals of Mathematics and Artificial Intelligence
Theory-specific automated reasoning
A 25-year perspective on logic programming
Sets with cardinality constraints in satisfiability modulo theories
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Specifying stateful asynchronous properties for distributed programs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
We present a decision procedure for a constraint language combining stratified sets of ur-elements with integers in the presence of a cardinality operator. Our decision procedure is an extension of the Nelson-Oppen combination method specifically tailored to the combination domain of sets, integers, and ur-elements.