A comparative study of several proof procedures

DOI10.1016/0004-3702(82)90024-8MaRDI QIDQ1836483zbMATH OpenOpenAlexFDO

Authors Wolfgang Bibel

Publication date 1982

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0004-3702(82)90024-8

zbMATH Keywords

algorithms for testing the complementarity of a matrix representing a propositional formulapath through a set of clauses

Mathematics Subject Classification ID

Cites work

• scientific article; zbMATH DE number 3729473 (Why is no real title available?)
• scientific article; zbMATH DE number 3774914 (Why is no real title available?)
• scientific article; zbMATH DE number 3487016 (Why is no real title available?)
• scientific article; zbMATH DE number 3507979 (Why is no real title available?)
• scientific article; zbMATH DE number 3560794 (Why is no real title available?)
• scientific article; zbMATH DE number 3568056 (Why is no real title available?)
• scientific article; zbMATH DE number 3212023 (Why is no real title available?)
• scientific article; zbMATH DE number 3335934 (Why is no real title available?)
• A Proof Procedure Using Connection Graphs
• A Search Technique for Clause Interconnectivity Graphs
• A Unifying View of Some Linear Herbrand Procedures
• An approach to a systematic theorem proving procedure in first-order logic
• On Matrices with Connections
• On the complexity of regular resolution and the Davis-Putnam procedure
• Refutation graphs
• Refutations by Matings
• Tautology testing with a generalized matrix reduction method
• Theorem Proving via General Matings

Cited in

(3)

• Computing prime implicants
• An SE-tree-based prime implicant generation algorithm
• On connections and higher-order logic

This page was built for publication: A comparative study of several proof procedures

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