Towards feasible solutions of the tautology problem

DOI10.1016/0003-4843(76)90020-6MaRDI QIDQ4119174zbMATH OpenOpenAlexWikidataFDO

Authors Bradford Dunham, Hao Wang

Publication date 1976

Published in Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0003-4843(76)90020-6

Mathematics Subject Classification ID

Classical propositional logic (03B05) Decidability of theories and sets of sentences (03B25) Analysis of algorithms and problem complexity (68Q25)

Cited in

(7)

• Tautology testing with a generalized matrix reduction method
• Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
• The linked conjunct method for automatic deduction and related search techniques
• Some hard examples for the resolution method
• Identifying efficient abductive hypotheses using multicriteria dominance relation
• Simulating circuit-level simplifications on CNF
• Spring Meeting of the Association for Symbolic Logic, San Francisco, 1991

This page was built for publication: Towards feasible solutions of the tautology problem

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