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

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

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

Publication date: 7 December 2022

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

zbMATH Keywords

concurrencyautomated theorem provingtableaux

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Communicating sequential processes
• Title not available (Why is that?)
• Theorem proving modulo
• Depth-first iterative-deepening: An optimal admissible tree search
• First-order automated reasoning with theories: when deduction modulo theory meets practice
• First-order tableau methods
• A taxonomy of parallel strategies for deduction
• The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Handbook of parallel constraint reasoning
• An Automation-Friendly Set Theory for the B Method

Cited In (2)

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

Uses Software

• TPTP
• PARTHEO
• Easychair
• HOT
• DISCOUNT

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104525)