Skip to main content
SpringerLink
Log in

NP-Logic Systems and Model-Equivalence Reductions

  • Short Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper we investigate the existence of model-equivalence reduction between NP-logic systems which are logic systems with model existence 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 an NP-system with model checking problem DP -complete.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gelfond M, Lifschitz V. The stable model semantics for logic programming. In Proc. the 5th International Conference on Logic Programming, Seattle, USA, Aug. 15-19, 1988, pp.1070–1080.

  2. Zhao X S, Shen Y P. Comparison of semantics of disjunctive logic programs based on model-equivalent reduction. Journal of Computer Science and Technology, 2007, 22(4): 562–568.

    Article  MathSciNet  Google Scholar 

  3. Büning H K, Lettmann T. Propositional Logic: Deduction and Algorithms. Cambridge University Press, 1999.

  4. Papadimitriou C H. Computational Complexity. Addison-Wesley, New York, 1994.

    MATH  Google Scholar 

  5. Lifschitz V, Razborov A. Why are there so many loop formulas. ACM Transactions on Computational Logic, 2006, 7(2): 261–268.

    Article  MathSciNet  Google Scholar 

  6. Zhao X S, Büning H K. Model-equivalent reductions. In SAT 2005, St Andrews, UK, Jun. 19-23, 2005, pp.355–370.

  7. Lin F Z, Zhao J C. On tight logic programs and yet another translation from normal logic programs to propositional logic. In Proc. IJCAI 2003, Acapulco, Mexico, Aug. 9-15, 2003, pp.853–858.

  8. Gabbay D M. What Is a Logical System? Oxford University Press, 1994.

  9. Plaisted D, Greenbaum S. A structure preserving clause form transformation. Journal of Symbolic Computation, 1986, 2(3): 293–304.

    Article  MATH  MathSciNet  Google Scholar 

  10. Sipser M. Introduction to the Theory of Computation. Second Edition, Thomson Course Technology Press, 2006.

  11. Cadoli M. Tractability Reasoning in Artificial Intelligence. Springer, Berlin, 1994.

  12. Papadimitriou C H, Wolfe D. The complexity of facets resolved. Journal of Computer and System Sciences, 1988, 37(1): 2–12.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Logic and Cognition, Sun Yat-Sen University, Guangzhou, 510275, China

    Yu-Ping Shen & Xi-Shun Zhao

  2. Department of Philosophy, Sun Yat-Sen University, Guangzhou, 510275, China

    Yu-Ping Shen

Authors
  1. Yu-Ping Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xi-Shun Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xi-Shun Zhao.

Additional information

Research was partially supported by the National Natural Science Foundation of China under Grant No. 60970040, Ministry of Education, Key Research Projects of Philosophy and Social Science under Grant No. 05JJD72040122 and the Sun Yat-Sen University Young Scholar Project.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shen, YP., Zhao, XS. NP-Logic Systems and Model-Equivalence Reductions. J. Comput. Sci. Technol. 25, 1321–1326 (2010). https://doi.org/10.1007/s11390-010-9408-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-010-9408-z

Keywords

Search

Navigation