Parsing/theorem-proving for logical grammar \textit{CatLog3}
From MaRDI portal
Publication:2425322
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Natural language processing (68T50) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Recommendations
Cites work
- A count invariant for Lambek calculus with additives and bracket modalities
- Anaphora and type logical grammar
- Bracket induction for Lambek calculus with bracket modalities
- Count-invariance including exponentials
- Dutch Grammar and Processing: A Case Study in TLG
- Extended Lambek calculi and first-order linear logic
- scientific article; zbMATH DE number 842687 (Why is no real title available?)
- scientific article; zbMATH DE number 6296859 (Why is no real title available?)
- scientific article; zbMATH DE number 3251420 (Why is no real title available?)
- scientific article; zbMATH DE number 3024527 (Why is no real title available?)
- Infinitary action logic: complexity, models and grammars
- Linear logic
- Logic programming of the displacement calculus
- Logic Programming with Focusing Proofs in Linear Logic
- Multimodal Linguistic Inference
- On Action Logic: Equational Theories of Action Algebras
- Proof Nets for Basic Discontinuous Lambek Calculus
- Proof nets for the displacement calculus
- Semantically Inactive Multiplicatives and Words as Types
- Soft linear logic and polynomial time
- The blind spot. Lectures on logic
- The displacement calculus
- The Lambek calculus enriched with additional connectives
- The logic of categorial grammars. A deductive account of natural language syntax and semantics
- The Mathematics of Sentence Structure
- Undecidability of the Lambek calculus with subexponential and bracket modalities
- Uniform proofs as a foundation for logic programming
Cited in
(15)- The multiplicative-additive Lambek calculus with subexponential and bracket modalities
- Non-associative, non-commutative multi-modal linear logic
- Natural language semantics and computability
- Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
- Logic programming of the displacement calculus
- scientific article; zbMATH DE number 3557728 (Why is no real title available?)
- CatLog3
- scientific article; zbMATH DE number 1523041 (Why is no real title available?)
- Count-invariance including exponentials
- Grammar specification in categorial logics and theorem proving
- Clausal Proofs and Discontinuity
- A categorial type logic
- Undecidability of a newly proposed calculus for CatLog3
- Explorations in Subexponential Non-associative Non-commutative Linear Logic
- On syntactic concept lattice models for the Lambek calculus and infinitary action logic
This page was built for publication: Parsing/theorem-proving for logical grammar \textit{CatLog3}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425322)