Skip to main content
SpringerLink
Log in

The Characterization on the Uniqueness of Answer Set for Prioritized Logic Programs

  • Conference paper
Foundations of Intelligent Systems (ISMIS 2003)

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

Included in the following conference series:

Abstract

Prioritized logic programming has illustrated its rich expressiveness and flexibility in knowledge representation and reasoning. However, some important aspects of prioritized logic programs have yet to be thoroughly explored. In this paper, we investigate basic properties of prioritized logic programs in the context of answer set semantics. Specifically, we propose a characterization on the uniqueness of answer set for prioritized logic programs, which has a weaker form than the traditional local stratification for general logic programs.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K.R., Bol, R.N.: Logic programming and negation: A survey. Journal of Logic Programming 19,20, 9–71 (1994)

    Article  MathSciNet  Google Scholar 

  2. Brewka, G., Eiter, T.: Preferred answer sets for extended logic programs. Artificial Intelligence 109, 297–356 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the Fifth Joint International Conference and Symposium, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  4. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–386 (1991)

    Article  Google Scholar 

  5. Grosof, B.N.: Prioritized conflict handling for logic programs. In: Proceedings of the 1997 International Logic Program Symposium (ILPS 1997), pp. 197–212. MIT Press, Cambridge (1997)

    Google Scholar 

  6. Lifschitz, V., Turner, H.: Splitting a logic program. In: Proceedings of Eleventh International Conference on Logic Programming, pp. 23–37. MIT Press, Cambridge (1994)

    Google Scholar 

  7. Zhang, Foo, N.Y.: Answer sets for prioritized logic programs. In: Proceedings of the 1997 International Logic Programming Symposium (ILPS 1997), pp. 69–83. MIT Press, Cambridge (1997)

    Google Scholar 

  8. Zhang, Y.: Logic program based updates (2003) (manuscript)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing and Information Technology, University of Western Sydney, Penrith South DC, NSW 1797, Australia

    Yan Zhang & Yun Bai

Authors
  1. Yan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yun Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The International WIC Institute, Beijing University of Technology, China

    Ning Zhong

  2. Department of Computer Science, University of North Carolina, NC 28223, Charlotte, USA

    Zbigniew W. Raś

  3. Shimane University, 89-1 Enya-cho Izumo, 6938501, Shimane, Japan

    Shusaku Tsumoto

  4. Department of Informatics, Graduate School of Information Science and Electrical Engineering, Kyushu University, 744 Motooka, Nishi, 819-0395, Fukuoka, Japan

    Einoshin Suzuki

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Y., Bai, Y. (2003). The Characterization on the Uniqueness of Answer Set for Prioritized Logic Programs. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds) Foundations of Intelligent Systems. ISMIS 2003. Lecture Notes in Computer Science(), vol 2871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39592-8_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39592-8_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20256-1

  • Online ISBN: 978-3-540-39592-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation