\textsf{Goéland}: a concurrent tableau-based theorem prover (system description)

DOI10.1007/978-3-031-10769-6_22OpenAlexW4289104062MaRDI QIDQ2104525

David Delahaye, Julie Cailler, Hinde Lilia Bouziane, Simon Robillard, Johann Rosain

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-10769-6_22

zbMATH Keywords

tableauxconcurrencyautomated theorem proving

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (2)

Goeland ⋮ The 11th IJCAR automated theorem proving system competition – CASC-J11

Uses Software

• TPTP
• PARTHEO
• Easychair
• HOT
• DISCOUNT

Cites Work

• Depth-first iterative-deepening: An optimal admissible tree search
• Theorem proving modulo
• A taxonomy of parallel strategies for deduction
• The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
• First-order automated reasoning with theories: when deduction modulo theory meets practice
• Communicating sequential processes
• Handbook of Parallel Constraint Reasoning
• An Automation-Friendly Set Theory for the B Method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \textsf{Goéland}: a concurrent tableau-based theorem prover (system description)