A Study of Symmetry Breaking Predicates and Model Counting

DOI10.1007/978-3-030-45190-5_7OpenAlexW3016605054MaRDI QIDQ5039506

No author found.

Publication date: 13 October 2022

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-45190-5_7

Mathematics Subject Classification ID

Classical propositional logic (03B05) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Computational aspects of satisfiability (68R07)

Uses Software

• MiniSat
• Symstra
• Kodkod
• OEIS
• TestEra
• Korat
• TACO
• sharpSAT
• Shatter
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic symmetry-breaking for Boolean satisfiability
• Automata-based model counting for string constraints
• The symmetry rule in propositional logic
• Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
• Algorithms for propositional model counting
• CDCLSym: introducing effective symmetry breaking in SAT solving
• Improved Static Symmetry Breaking for SAT
• Specification-Based Program Repair Using SAT
• $$\#\exists $$ SAT: Projected Model Counting
• Short XORs for Model Counting: From Theory to Practice
• The Complexity of Enumeration and Reliability Problems
• Theories of Program Testing and the Application of Revealing Subdomains
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Automatically comparing memory consistency models
• Tools and Algorithms for the Construction and Analysis of Systems
• Theory and Applications of Satisfiability Testing
• Kodkod: A Relational Model Finder

This page was built for publication: A Study of Symmetry Breaking Predicates and Model Counting