scientific article; zbMATH DE number 6970797

DOI10.23638/LMCS-14(4:12)2018zbMath1403.68044arXiv1702.06259MaRDI QIDQ4553283

Andrew Reynolds, Clark Barrett, Kshitij Bansal, Cesare Tinelli

Publication date: 2 November 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite setssatisfiability modulo theoriesdecision procedures

Mathematics Subject Classification ID

Logic in computer science (03B70) Data structures (68P05)

Related Items (1)

A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals

Uses Software

• SMT-LIB
• Leon
• CVC4
• SETL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combining sets with cardinals
• Deciding Boolean algebra with Presburger arithmetic
• Decision procedures for theories of sets with measures
• Counting Constraints in Flat Array Fragments
• A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT
• Sets with Cardinality Constraints in Satisfiability Modulo Theories
• A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited
• Solving SAT and SAT Modulo Theories
• Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
• A Decision Procedure for Sets, Binary Relations and Partial Functions
• Term Rewriting and All That
• Polite Theories Revisited
• Locality Results for Certain Extensions of Theories with Bridging Functions
• Decision Procedures for Multisets with Cardinality Constraints

This page was built for publication: