Two proof procedures for a cardinality based language in propositional calculus

DOI10.1007/3-540-57785-8_132MaRDI QIDQ4942636zbMATH OpenFDO

Authors Belaïd Benhamou, Lakhdar Sais, Pierre Siegel

Publication date 16 March 2000

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

Full work available at URL https://doi.org/10.1007/3-540-57785-8_132

Mathematics Subject Classification ID

Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)

Cited in

(4)

• Propositional distances and compact preference representation
• Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
• Dealing with satisfiability and \(n\)-ary CSPs in a logical framework
• Some computational aspects of DISTANCE SAT

This page was built for publication: Two proof procedures for a cardinality based language in propositional calculus

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