Skip to main content

Restricted Four-Valued Semantics for Answer Set Programming

  • Conference paper
  • First Online:
PRICAI 2016: Trends in Artificial Intelligence (PRICAI 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9810))

Included in the following conference series:

  • 2555 Accesses

Abstract

In answer set programming, an extended logic program may have no answer set, or only one trivial answer set. In this paper, we propose a new stable model semantics based on the restricted four-valued logic to overcome both inconsistences and incoherences in answer set programming. Our stable models coincide with classical answer sets when reasoning on consistent and coherent logic programs, and can be solved by transformation in existing ASP solvers. We also show the connection between our stable models and the extensions of default logic.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alcântara, J., Damásio, C.V., Pereira, L.M.: A declarative characterisation of disjunctive paraconsistent answer sets. In: ECAI, vol. 16, p. 951. Citeseer (2004)

    Google Scholar 

  2. Amendola, G., Eiter, T., Leone, N.: Modular paracoherent answersets. In: Proceedings of Logics in Artificial Intelligence - 14th European Conference, JELIA 2014, Funchal, Madeira, Portugal, 24–26 September 2014, pp. 457–471 (2014). http://dx.doi.org/10.1007/978-3-319-11558-0_32

  3. Arieli, O., Avron, A.: The value of the four values. Artif. Intell. 102(1), 97–141 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Belnap, N.: How a computer should think. In: Ryle, G. (ed.) Contemporary Aspects of Philosophy. Oriel Press Ltd., London (1977)

    Google Scholar 

  5. Belnap Jr., N.D.: A useful four-valued logic. In: Michael Dunn, J., Epstein, G. (eds.) Modern Uses of Multiple-valued Logic, pp. 5–37. Springer, Netherlands (1977)

    Chapter  Google Scholar 

  6. Blair, H.A., Subrahmanian, V.: Paraconsistent logic programming. Theor. Comput. Sci. 68(2), 135–154 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  7. Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Trans. Knowl. Data Eng. 12(5), 845–860 (2000)

    Article  Google Scholar 

  8. Chen, C., Lin, Z.: Restricted four-valued logic for default reasoning. Knowledge Science, Engineering and Management. LNCS, vol. 9403, pp. 40–52. Springer International Publishing, Cham (2015). http://dx.doi.org/10.1007/978-3-319-25159-2_4

    Chapter  Google Scholar 

  9. Eiter, T., Fink, M., Moura, J.: Paracoherent answer set programming. In: KR, pp. 486–496 (2010)

    Google Scholar 

  10. Fitting, M.: Bilattices and the semantics of logic programming. J. Logic Program. 11(2), 91–116 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fitting, M.: Fixpoint semantics for logic programming a survey. Theor. Comput. Sci. 278(1), 25–51 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3–4), 365–385 (1991)

    Article  MATH  Google Scholar 

  13. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Logic (TOCL) 7(3), 499–562 (2006)

    Article  MathSciNet  Google Scholar 

  14. Odintsov, S., Pearce, D.J.: Routley semantics for answer sets. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 343–355. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Pearce, D.J., Valverde, A.: Quantified equilibrium logic and foundations for answer set programs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 546–560. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Reiter, R.: A logic for default reasoning. Artif. Intell. 13(1), 81–132 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ruet, P., Fages, F.: Combining explicit negation and negation by failure via belnap’s logic. Theor. Comput. Sci. 171(1), 61–75 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  18. Sakama, C., Inoue, K.: Paraconsistent stable semantics for extended disjunctive programs. J. Logic Comput. 5(3), 265–285 (1995)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work is partially supported by the Advance Programs Fund of Ministry of Education of China and Natural Science Foundation of China.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zuoquan Lin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Chen, C., Lin, Z. (2016). Restricted Four-Valued Semantics for Answer Set Programming. In: Booth, R., Zhang, ML. (eds) PRICAI 2016: Trends in Artificial Intelligence. PRICAI 2016. Lecture Notes in Computer Science(), vol 9810. Springer, Cham. https://doi.org/10.1007/978-3-319-42911-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42911-3_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42910-6

  • Online ISBN: 978-3-319-42911-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics