Horn programming in linear logic is NP-complete
- 2 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 200-210
- https://doi.org/10.1109/lics.1992.185533
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Linearizing intuitionistic implicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Decision problems for propositional linear logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient program synthesis: Semantics, logic, complexityPublished by Springer Nature ,1991
- Linear logicTheoretical Computer Science, 1987
- An Algorithm for the General Petri Net Reachability ProblemSIAM Journal on Computing, 1984
- Intuitionistic propositional logic is polynomial-space completeTheoretical Computer Science, 1979