Automated Inference of Finite Unsatisfiability

DOI10.1007/978-3-642-02959-2_29zbMath1237.68178OpenAlexW1963220690MaRDI QIDQ5191115

Ann Lillieström, Koen Claessen

Publication date: 28 July 2009

Published in: Automated Deduction – CADE-22 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02959-2_29

Mathematics Subject Classification ID

Related Items (2)

On deciding satisfiability by theorem proving with speculative inferences ⋮ Automated inference of finite unsatisfiability

Uses Software

• LEO-II
• TPTP
• Prover9
• Mace4
• E Theorem Prover

Cites Work

• Unnamed Item
• Unnamed Item
• The TPTP problem library. CNF release v1. 2. 1
• Solution of the Robbins problem

This page was built for publication: Automated Inference of Finite Unsatisfiability