Skip to Main content Skip to Navigation
Conference papers

SCL: Clause Learning from Simple Models

Alberto Fiori 1, 2 Christoph Weidenbach 1, 2
1 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Several decision procedures for the Bernays-Schoenfinkel (BS) fragment of first-order logic rely on explicit model assumptions. In particular, the procedures differ in their respective model representation formalisms. We introduce a new decision procedure SCL deciding the BS fragment. SCL stands for clause learning from simple models. Simple models are solely built on ground literals. Nevertheless, we show that SCL can learn exactly the clauses other procedures learn with respect to more complex model representation formalisms. Therefore, the overhead of complex model representation formalisms is not always needed. SCL is sound and complete for full first-order logic without equality.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download
Contributor : Stephan Merz <>
Submitted on : Wednesday, December 11, 2019 - 5:30:25 PM
Last modification on : Tuesday, December 17, 2019 - 2:25:37 AM
Long-term archiving on: : Thursday, March 12, 2020 - 11:09:16 PM


Files produced by the author(s)




Alberto Fiori, Christoph Weidenbach. SCL: Clause Learning from Simple Models. 27th International Conference on Automated Deduction, 2019, Natal, Brazil. pp.233-249, ⟨10.1007/978-3-030-29436-6_14⟩. ⟨hal-02405550⟩



Record views


Files downloads