CDCL-Based Abstract State Transition System for Coherent Logic

DOI10.1007/978-3-642-31374-5_18MaRDI QIDQ2907328zbMATH OpenOpenAlexFDO

Authors Mladen Nikolić, Predrag Janičić

Publication date 7 September 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-31374-5_18

zbMATH Keywords

abstract state-transition systemsCDCL SAT solvingcoherent logicmachine verifiable proofsreadable proofs

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Recommendations

• Finite state machine logic synthesis for complex programmable logic devices
• Logic synthesis for VLSI-based combined finite state machines. Synthesis targeting ASICs, CPLDs and FPGAs
• scientific article; zbMATH DE number 1841822
• Logic Synthesis for Switching Lattices
• scientific article; zbMATH DE number 1294428
• Logic of transition systems
• Synthesis of transition systems from quantum logics

Cited in

(4)

• Theorem proving as constraint solving with coherent logic
• On the mechanization of the proof of Hessenberg's theorem in coherent logic
• From informal to formal proofs in Euclidean geometry
• Theorem proving as constraint solving for coherent logic with function symbols

This page was built for publication: CDCL-Based Abstract State Transition System for Coherent Logic

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