Satisfiability: where Theory meets Practice (Invited Talk).

DOI10.4230/LIPICS.CSL.2012.12zbMATH Open1252.68156OpenAlexW2253476229MaRDI QIDQ4649533FDOQ4649533

Authors: Inês Lynce 

Publication date: 22 November 2012

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2012/3660/

Recommendations

• The complexity of constraint satisfaction problems (invited talk)
• scientific article; zbMATH DE number 1222558
• Satisfiability checking: theory and applications
• Satisfiability modulo theories: an appetizer
• A Tutorial on Satisfiability Modulo Theories
• Some interesting research directions in satisfiability
• Beyond satisfiability: extensions and applications
• A constructive investigation of satisfiability
• A survey of satisfiability modulo theory

zbMATH Keywords

applicationspropositional satisfiabilitySAT solvers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (3)

• SAT 2005. Satisfiability Research in the Year 2005.
• Computing with SAT oracles: past, present and future
• SAT-solving in practice, with a tutorial example from supervisory control

This page was built for publication: Satisfiability: where Theory meets Practice (Invited Talk).

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