Anytime Approximations of Classical Logic from Above

DOI10.1093/LOGCOM/EXL018MaRDI QIDQ3437258zbMATH OpenOpenAlexFDO

Authors Marcelo Finger, Renata Wassermann

Publication date 14 May 2007

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

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

zbMATH Keywords

approximate reasoningautomated reasoningsatisfiabilitytheorem proving

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 2014708
• Logics in Artificial Intelligence
• Advances in Artificial Intelligence – SBIA 2004
• The universe of approximations
• Anytime clausal reasoning

Cited in

(6)

• Anytime clausal reasoning
• scientific article; zbMATH DE number 1301762 (Why is no real title available?)
• scientific article; zbMATH DE number 2014708 (Why is no real title available?)
• Advances in Artificial Intelligence – SBIA 2004
• Logics in Artificial Intelligence
• Polyhedral semantics and the tractable approximation of Łukasiewicz infinitely-valued logic

This page was built for publication: Anytime Approximations of Classical Logic from Above

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