\textsf{Goéland}: a concurrent tableau-based theorem prover (system description)
type: Item
instance of: scholarly article
title: \textsf{Goéland}: a concurrent tableau-based theorem prover (system description)
DOI: 10.1007/978-3-031-10769-6_22
author: Julie Cailler
author: Johann Rosain
author: David Delahaye
author: Simon Robillard
author: Hinde Lilia Bouziane
publication date: 2022-12-07T00:00:00Z
Mathematics Subject Classification ID: 68V15
zbMATH DE Number: 7628198
zbMATH Keywords: automated theorem proving
zbMATH Keywords: tableaux
zbMATH Keywords: concurrency
describes a project that uses: TPTP
describes a project that uses: DISCOUNT
describes a project that uses: PARTHEO
describes a project that uses: HOT
describes a project that uses: Easychair
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-031-10769-6 22
OpenAlex ID: W4289104062
cites work: Q4797443
cites work: Q3290715
cites work: A taxonomy of parallel strategies for deduction
cites work: Handbook of parallel constraint reasoning
cites work: First-order automated reasoning with theories: when deduction modulo theory meets practice
cites work: An Automation-Friendly Set Theory for the B Method
cites work: Theorem proving modulo
cites work: Q3996619
cites work: Q3227561
cites work: Communicating sequential processes
cites work: Q4247078
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: First-order tableau methods
cites work: Q3491009
cites work: The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
copyright license: Creative Commons Attribution 4.0 International
description: scientific article; zbMATH DE number 7628198