Logic in computer science
branch-and-bound algorithmlinear programminginteger programmingresolutiondecidabilityfirst-order logicTuring completenessMaxSATtemporal logicHoare logiclinear temporal logicsemantic tableauxformal verificationSAT solversunificationpropositional logiclogic programmingPrologsimplex algorithmloop invariantsdifference logiclinear arithmeticconflict-driven clause learningBoolean constraint propagationDPLL algorithmNOS algorithmpropositional abstraction
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27) Logic in computer science (03B70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
This page was built for publication: Logic in computer science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7012990)