Constrained pseudo-propositional logic

DOI10.1007/S11787-020-00266-XzbMATH Open1475.03064OpenAlexW3094993302MaRDI QIDQ2228353FDOQ2228353

Authors: 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

Recommendations

• Propositional calculus problems in CHIP
• scientific article; zbMATH DE number 5139168
• scientific article; zbMATH DE number 1882048
• New Encodings of Pseudo-Boolean Constraints into CNF
• Constraint programming for modelling and solving modal satisfiability

zbMATH Keywords

SATpropositional logicproof systempseudo-Boolean constraints

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Semiring-induced propositional logic: definition and basic algorithms
• Contraction in propositional logic
• Inhibited Effects in CP-Logic
• Local-search techniques for propositional logic extended with cardinality constraints

Uses Software

• Velev SAT Benchmarks

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

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