T-resolution: Refinements and model elimination

DOI10.1023/A:1006170514174MaRDI QIDQ1284706zbMATH OpenOpenAlexFDO

Authors Andrea Formisano, Alberto Policriti

Publication date 25 January 2000

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1006170514174

zbMATH Keywords

\(T\)-resolution\(T\)-theorem proving

Mathematics Subject Classification ID

Recommendations

• T-theorem proving. I
• Resolution theorem proving
• Automated theorem proving in temporal logic: T-resolution
• scientific article; zbMATH DE number 1407682

Cited in

(8)

• Useful mathematical relationships embedded in Tversky's \textit{elimination by aspects} model.
• Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators
• T-theorem proving. I
• Characterizing Tseitin-formulas with short regular resolution refutations
• scientific article; zbMATH DE number 4047182 (Why is no real title available?)
• Using resolution for deciding solvable classes and building finite models
• Goals and benchmarks for automated map reasoning
• Filter-based resolution principle for lattice-valued propositional logic LP(X)

This page was built for publication: \(T\)-resolution: Refinements and model elimination

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