Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.03017OpenAlexW2494235144MaRDI QIDQ5325853FDOQ5325853

Authors: Hans Kleine Büning, Xishun Zhao, K. Subramani 

Publication date: 24 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95238

Recommendations

• Logic versus Approximation
• Models and quantifier elimination for quantified Horn formulas
• Theory and Applications of Satisfiability Testing
• Boolean functions as models for quantified Boolean formulas
• Theory and Applications of Satisfiability Testing
• On a Boolean-valued model for modal propositional systems
• A satisfiability procedure for quantified Boolean formulae
• Dependency Quantified Horn Formulas: Models and Complexity
• Nested Boolean functions as models for quantified Boolean formulas

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (6)

• Title not available (Why is that?)
• Logic versus Approximation
• Models and quantifier elimination for quantified Horn formulas
• Boolean functions as models for quantified Boolean formulas
• Theory and Applications of Satisfiability Testing
• Computational complexity of quantified Boolean formulas with fixed maximal deficiency

This page was built for publication: Theory and Applications of Satisfiability Testing

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