Pages that link to "Item:Q1337693"
From MaRDI portal
The following pages link to The complexity of Horn fragments of linear logic (Q1337693):
Displaying 16 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Collaborative planning with confidentiality (Q540688) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- Direct encodings of NP-complete problems into Horn sequents of multiplicative linear logic (Q1648864) (← links)
- On the decision problem for MELL (Q1733062) (← links)
- Petri nets, Horn programs, linear logic and vector games (Q1899147) (← links)
- Linear logic automata (Q1919766) (← links)
- Lambek calculus is NP-complete (Q2500488) (← links)
- (Q3509063) (← links)
- The linear logic of multisets (Q4222188) (← links)
- RASP and ASP as a fragment of linear logic (Q4583307) (← links)
- (Q4783300) (← links)
- System NEL is Undecidable (Q4924537) (← links)
- (Q5094132) (← links)
- An application of proof-nets to the study of fragments of the Lambek calculus (Q5198508) (← links)
- Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic (Q5224503) (← links)