Abstract
We generalize propositional analytic tableaux for classical and many-valued logics to constraint tableaux. We show that this technique provides a new translation from deduction into integer programming. The main advantages are (i) an efficient satisfiability checking procedure for classical and, for the first time, for a wide range of many-valued, including infinitely-valued propositional logics; (ii) a new point of view on classifying complexity of many-valued logics; (iii) easy NPcontainment proofs for many-valued logics.KeywordsClassical LogicTruth TableConstraint SystemInteger Program ProblemProof TreeThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
