On an unsatisfiability-satisfiability prover

DOI10.2977/PRIMS/1195173764MaRDI QIDQ1264000zbMATH OpenOpenAlexFDO

Authors Chiharu Hosono

Publication date 1989

Published in Publications of the Research Institute for Mathematical Sciences, Kyoto University (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2977/prims/1195173764

zbMATH Keywords

automated theorem provingfinite domainHerbrand universe

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Recommendations

• scientific article; zbMATH DE number 4088977
• scientific article; zbMATH DE number 956865
• scientific article; zbMATH DE number 1614715
• Solving the incremental satisfiability problem
• Beyond satisfiability: extensions and applications

Cites work

• scientific article; zbMATH DE number 4108722 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• A superposition oriented theorem prover
• Theorem Proving via General Matings
• Theorem proving with abstraction
• Theorem proving with variable-constrained resolution

Cited in

(6)

• A threshold for unsatisfiability
• scientific article; zbMATH DE number 4088977 (Why is no real title available?)
• Towards a Semantics of Unsatisfiability Proofs with Inprocessing
• scientific article; zbMATH DE number 2236687 (Why is no real title available?)
• scientific article; zbMATH DE number 2159161 (Why is no real title available?)
• Computer Science Logic

This page was built for publication: On an unsatisfiability-satisfiability prover

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