Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

LFCS
1997
Springer

favoriteEmaildiscussreport

120views Artificial Intelligence» more LFCS 1997»

The Concurrency Complexity for the Horn Fragment of Linear Logic

13 years 8 months ago

The Concurrency Complexity for the Horn Fragment of Linear Logic

Download pmkinfo.tversu.ru

The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various deﬁnitions of concurrency proposed in [2] and establish the complexity of the provability problem and the problem of concurrency recognition. The notion of k-maximal concurrency is introduced which guarantees polynomial time provability. Theorems on hierarchy and on complexity of recognition of the property are proved.

Sergey Dudakov

Real-time Traffic

Artificial Intelligence | Concurrency Recognition | LFCS 1997 | Polynomial Time Provability | Provability Problem |

claim paper

Related Content

» On the Complexity of Fragments of Modal Logics

» On the Complexity of Axiom Pinpointing in the EL Family of Description Logics

» WorstCase Optimal Reasoning for the HornDL Fragments of OWL 1 and 2

» Complexity of Axiom Pinpointing in the DLLite Family of Description Logics

» AspectOriented Programming in HigherOrder and Linear Logic

» Variables as Resource for SharedMemory Programs Semantics and Soundness

» Past is for free on the complexity of verifying linear temporal properties with past

» Hybrid Logics on Linear Structures Expressivity and Complexity

» Lolliproc to concurrency from classical linear logic via curryhoward and control

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1997
Where	LFCS
Authors	Sergey Dudakov

Comments (0)