Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
35
click to vote
TABLEAUX
1999
Springer
favorite
Email
discuss
report
142
views
Artificial Intelligence
»
more
TABLEAUX 1999
»
The Non-Associative Lambek Calculus with Product in Polynomial Time
14 years 3 months ago
Download
www.loria.fr
We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open prolem.
Philippe de Groote
Real-time Traffic
Artificial Intelligence
|
Decision Problem
|
Non-associative Lambek Calculus
|
Sequent Calculus
|
TABLEAUX 1999
|
claim paper
Post Info
More Details (n/a)
Added
05 Aug 2010
Updated
05 Aug 2010
Type
Conference
Year
1999
Where
TABLEAUX
Authors
Philippe de Groote
Comments
(0)
Researcher Info
Artificial Intelligence Study Group
Computer Vision