Satisfiability on mixed instances

DOI10.1145/2840728.2840768MaRDI QIDQ2800587zbMATH OpenOpenAlexFDO

Authors Ruiwen Chen, Rahul Santhanam

Publication date 15 April 2016

Published in Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://www.pure.ed.ac.uk/ws/files/25046586/TR15_192.pdf

zbMATH Keywords

quantified Boolean formulaBoolean satisfiability algorithmmixed instance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Satisfiability of mixed Horn formulas
• Satisfiability in multi-valued circuits
• Satisfiability in MultiValued Circuits
• scientific article; zbMATH DE number 1099516
• Solving mixed and conditional constraint satisfaction problems
• Combined Satisfiability Modulo Parametric Theories
• A constructive investigation of satisfiability
• Satisfiability modulo theories and assignments
• Deciding the satisfiability of MITL specifications
• Satisfiability Procedures for Combination of Theories Sharing Integer Offsets

Cited in

(5)

• Satisfiability of mixed Horn formulas
• Tighter connections between Formula-SAT and shaving logs
• Theory and Applications of Satisfiability Testing
• CNF satisfiability in a subspace and related problems
• On Some Aspects of Mixed Horn Formulas

This page was built for publication: Satisfiability on mixed instances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800587)