Partial instantiation methods for inference in first-order logic

DOI10.1023/A:1015854101244zbMath0995.03010OpenAlexW2147593720MaRDI QIDQ1610676

R. Smith

Publication date: 20 August 2002

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

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

zbMATH Keywords

satisfiability algorithmsprimal-dual strategy

Mathematics Subject Classification ID

Related Items (7)

The model evolution calculus as a first-order DPLL method ⋮ Comparing instance generation methods for automated reasoning ⋮ The disconnection tableau calculus ⋮ Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning ⋮ Solving quantified verification conditions using satisfiability modulo theories ⋮ Combining Instance Generation and Resolution ⋮ SMELS: satisfiability modulo equality with lazy superposition

This page was built for publication: Partial instantiation methods for inference in first-order logic