SAT and SMT technology for many-valued logics

MaRDI QIDQ4583798zbMATH OpenFDO

Authors Carlos Ansótegui, Miquel Bofill, Felip Manya, Mateu Villaret

Publication date 3 September 2018

Full work available at URL http://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-24-number-1-4-2015/mvlsc-24-1-4-p-151-172/

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Many-valued logic (03B50) Logic in artificial intelligence (68T27)

Recommendations

• Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
• Short Conjunctive Normal Forms in Finitely Valued Logics
• Many-valued logic and mixed integer programming
• Extending the reach of SAT with many-valued logics
• Resolution-based theorem proving for many-valued logics

Cited in

(4)

• A non-clausal tableau calculus for \textsc{MinSat}
• New complexity results for Łukasiewicz logic
• The complexity of 3-valued Łukasiewicz rules
• A first polynomial non-clausal class in many-valued logic

This page was built for publication: SAT and SMT technology for many-valued logics

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