DeepAI
Log In Sign Up

Introduction to a Hypergraph Logic Unifying Different Variants of the Lambek Calculus

03/01/2021
by   Tikhon Pshenitsyn, et al.
0

In this paper hypergraph Lambek calculus (HL) is presented. This formalism aims to generalize the Lambek calculus (L) to hypergraphs as hyperedge replacement grammars extend context-free grammars. In contrast to the Lambek calculus, HL deals with hypergraph types and sequents; its axioms and rules naturally generalize those of L. Consequently, certain properties (e.g. the cut elimination) can be lifted from L to HL. It is shown that L can be naturally embedded in HL; moreover, a number of its variants (LP, NL, NLP, L with modalities, L^∗(1), L^R) can also be embedded in HL via different graph constructions. We also establish a connection between HL and Datalog with embedded implications. It is proved that the parsing problem for HL is NP-complete.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/21/2021

Grammars Based on a Logic of Hypergraph Languages

The hyperedge replacement grammar (HRG) formalism is a natural and well-...
04/26/2013

Introduction to Judea Pearl's Do-Calculus

This is a purely pedagogical paper with no new results. The goal of the ...
01/19/2020

Infinitary Action Logic with Exponentiation

We introduce infinitary action logic with exponentiation—that is, the mu...
10/15/2019

Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents

This paper employs the recently introduced linear nested sequent framewo...
12/31/2017

Two Light Modalities for Recursion

We investigate the interplay between two modalities for controlling the ...