The Concurrency Complexity for the Horn Fragment of Linear Logic

The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions 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.

• Type: Conference
• Year: 1997
• Where: LFCS
• Authors: Sergey Dudakov
• Keywords: Artificial Intelligence, Concurrency Recognition, LFCS 1997, Polynomial Time Provability, Provability Problem