Resolution procedures for multiple-valued optimization

DOI10.1016/J.INS.2012.12.004zbMATH Open1293.03010OpenAlexW1966214922WikidataQ60512084 ScholiaQ60512084MaRDI QIDQ2510176FDOQ2510176

Authors: Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manya 

Publication date: 1 August 2014

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2012.12.004

Recommendations

• The SAT problem of signed CNF formulas
• scientific article; zbMATH DE number 1076964
• A framework for automated reasoning in multiple-valued logics
• A logical approach to efficient Max-SAT solving
• On the refutational completeness of signed binary resolution and hyperresolution

zbMATH Keywords

optimizationresolutionmaximum satisfiabilitymultiple-valued logicssigned logic

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Many-valued logic (03B50) Mechanization of proofs and logical operations (03B35)

Cited In (4)

• On the refutational completeness of signed binary resolution and hyperresolution
• MaxSAT resolution for regular propositional logic
• A first polynomial non-clausal class in many-valued logic
• The SAT problem of signed CNF formulas

This page was built for publication: Resolution procedures for multiple-valued optimization

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