Constrained pseudo-propositional logic

DOI10.1007/s11787-020-00266-xzbMath1475.03064OpenAlexW3094993302MaRDI QIDQ2228353

Ahmad-Saher Azizi-Sultan

Publication date: 17 February 2021

Published in: Logica Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11787-020-00266-x

zbMATH Keywords

propositional logicproof systemSATpseudo-Boolean constraints

Mathematics Subject Classification ID

Classical propositional logic (03B05) Abstract deductive systems (03B22)

Uses Software

• Velev SAT Benchmarks

Cites Work

• Unnamed Item
• On the complexity of cutting-plane proofs
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving
• New Encodings of Pseudo-Boolean Constraints into CNF
• The complexity of theorem-proving procedures

This page was built for publication: Constrained pseudo-propositional logic