\(T\)-resolution: Refinements and model elimination

DOI10.1023/A:1006170514174zbMath0929.68112OpenAlexW1531105966MaRDI QIDQ1284706

Alberto Policriti, Andrea Formisano

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

Related Items

Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) ⋮ Goals and benchmarks for automated map reasoning ⋮ Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators