Completeness of Resolution for Definite Answers

DOI10.1093/LOGCOM/5.4.449MaRDI QIDQ4847378zbMATH OpenOpenAlexFDO

Authors Tanel Tammet

Publication date 20 September 1995

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/d57686518c8105987ca304fff82dcc90b01221c0

zbMATH Keywords

program extraction from specificationsresolution method

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 2079036
• scientific article; zbMATH DE number 4200168
• scientific article; zbMATH DE number 517062
• Extracting the resolution algorithm from a completeness proof for the propositional calculus
• scientific article; zbMATH DE number 683345

Cited in

(7)

• Confidences for commonsense reasoning
• scientific article; zbMATH DE number 5859861 (Why is no real title available?)
• scientific article; zbMATH DE number 2079036 (Why is no real title available?)
• Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus
• Extracting the resolution algorithm from a completeness proof for the propositional calculus
• Program Synthesis in Saturation
• Synthesis of recursive programs in saturation

This page was built for publication: Completeness of Resolution for Definite Answers

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