Search Sciweavers | Sciweavers

2 search results - page 1 / 1

» Product-Free Lambek Calculus Is NP-Complete

127

click to vote

LFCS
2009
Springer

201views Artificial Intelligence» more LFCS 2009»

Product-Free Lambek Calculus Is NP-Complete

15 years 9 months ago

Download tr.cs.gc.cuny.edu

In this paper we prove that the derivability problems for productfree Lambek calculus and product-free Lambek calculus allowing empty premises are NP-complete. Also we introduce a...

Yury Savateev

claim paper

Read More »

click to vote

COLING
2008

114views Computational Linguistics» more COLING 2008»

Efficiently Parsing with the Product-Free Lambek Calculus

15 years 4 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers