Author of the publication

Product-Free Lambek Calculus Is NP-Complete.

. LFCS, volume 5407 of Lecture Notes in Computer Science, page 380-394. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic., , , and . J. Artif. Intell. Res., (2023)Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs., and . WoLLIC, volume 11541 of Lecture Notes in Computer Science, page 569-583. Springer, (2019)The 1st Workshop on Decentralised Search and Recommendation., , , , , , , , and . WWW (Companion Volume), page 1705-1708. ACM, (2024)Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic., , , and . CoRR, (2022)Non-Well-Founded Proofs for the Grzegorczyk Modal Logic., and . Rev. Symb. Log., 14 (1): 22-50 (2021)Unique Characterisability and Learnability of Temporal Instance Queries., , , , , and . KR, (2022)Cut-Elimination for the Modal Grzegorczyk Logic via Non-well-founded Proofs., and . WoLLIC, volume 10388 of Lecture Notes in Computer Science, page 321-335. Springer, (2017)Product-Free Lambek Calculus Is NP-Complete.. LFCS, volume 5407 of Lecture Notes in Computer Science, page 380-394. Springer, (2009)Proof internalization in generalized Frege systems for classical logic.. Ann. Pure Appl. Log., 165 (1): 340-356 (2014)Unidirectional Lambek Grammars in Polynomial Time.. Theory Comput. Syst., 46 (4): 662-672 (2010)