Introduction to Mathematics of Satisfiability
clausal logiccompactnessCraig lemmaDPLLfixpoint theoremnormal formsNP-completenesspropositional logicresolutionSATsatisfiability
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
- Autark assignments of Horn CNFs
- Lego-like spheres and tori
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
- Bridging constraint satisfaction and Boolean satisfiability
- Mathematical Logic for Computer Science
- Disjunctive Programs with Set Constraints
- SAT 2005. Satisfiability Research in the Year 2005.
- scientific article; zbMATH DE number 5605058 (Why is no real title available?)
- scientific article; zbMATH DE number 702472 (Why is no real title available?)
- scientific article; zbMATH DE number 1380573 (Why is no real title available?)
- Design of Logic‐based Intelligent Systems
- Handbook of satisfiability. In 2 parts
- Introduction to propositional satisfiability
- A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium
This page was built for publication: Introduction to Mathematics of Satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399426)
