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

DOI10.1145/3625230arXiv2105.03005OpenAlexW3162701640MaRDI QIDQ6201710

Gianfranco Rossi, Maximiliano Cristiá

Publication date: 21 February 2024

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

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

zbMATH Keywords

set theoryconstraint logic programmingdecision procedureinteger intervals\{log\}

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• A pearl on SAT and SMT solving in Prolog
• Deciding Boolean algebra with Presburger arithmetic
• Improving linear constraint propagation by changing constraint representation
• A set solver for finite set relation algebra
• Automated proof of Bell-LaPadula security properties
• An automatically verified prototype of the Tokeneer ID station specification
• Model checking interval temporal logics with regular expressions
• Solving quantifier-free first-order constraints over finite sets and binary relations
• An analysis of arithmetic constraints on integer intervals
• A class of polynomially solvable range constraints for interval analysis without widenings
• Automated reasoning with restricted intensional sets
• Reasoning about temporal relations
• The B-Book
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals