Grail: An automated proof assistant for categorial grammar logics. The Grail system is a tool for the development and prototyping of grammar fragments for categorial logics. Grail is an automated theorem prover based on proof nets, a graph-based representation of proofs, and labeled deduction.
Keywords for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Kanovich, Max; Kuznetsov, Stepan; Nigam, Vivek; Scedrov, Andre: Subexponentials in non-commutative linear logic (2019)
- Moot, Richard; Retoré, Christian: Natural language semantics and computability (2019)
- Morrill, Glyn: A categorial type logic (2014)
- Real, Livy; Retoré, Christian: Deverbal semantics and the Montagovian generative lexicon (\Lambda\mathsfTy_n) (2014)
- Moot, Richard; Retoré, Christian: The logic of categorial grammars. A deductive account of natural language syntax and semantics (2012)
- Retoré, Christian; Salvati, Sylvain: A faithful representation of non-associative Lambek grammars in abstract categorial grammars (2010)
- Moortgat, Michael; Moot, Richard: CGN to grail. Extracting a type-logical lexicon from the CGN annotation (2001) ioport