Yuping Shen (Institute of Logic and Cognition, Sun Yat-sen University) |
Xishun Zhao (Institute of Logic and Cognition, Sun Yat-sen University) |
In this paper we investigate the existence of model-equivalence reduction between NP-logic systems which are logic systems with model existence problem in NP. It is shown that among all NP-systems with model checking problem in NP, the existentially quantified propositional logic (∃PF) is maximal with respect to poly-time model-equivalent reduction. However, ∃PF seems not a maximal NP-system in general because there exits a NP-system with model checking problem D^P-complete. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.24.17 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |