Skip to main content
SpringerLink
Log in

The Minimal Negated Model Semantics of Assumable Logic Programs

  • Conference paper
  • First Online:
Knowledge Science, Engineering and Management (KSEM 2023)

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

  • 377 Accesses

Abstract

Assumable Logic Programming (ALP) extends the regular logic programs with an assumption operator \(\textbf{C}\). The intuition of \(\textbf{C}p\) is that it is acceptable to assume p unless it is forced not to. This paper presents the minimal negated model semantics, a new semantics of ALP, where the minimal negated set is defined to formalize this intuition. The assumptions in this set must be negated, and the ones outside are considered acceptable. This paper also discusses the relationship between the minimal negated model semantics and the stable model semantics. This new semantics provides new insight into assumable logic programming.

This work was supported by the Pre-research Key Laboratory Fund for Equipment (Grant No. 6142101210205).

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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

Notes

  1. 1.

    The predicates and terms are abbreviated to their initials.

  2. 2.

    The reverse reduct of an ALPN program is an ordinary answer set program, whose stable models are also called “answer sets.”.

References

  1. Balduccini, M., Gelfond, M.: Logic programs with consistency-restoring rules. In: International Symposium on Logical Formalization of Commonsense Reasoning, AAAI 2003 Spring Symposium Series, vol. 102 (2003)

    Google Scholar 

  2. Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. Theory Pract. Log. Program. 9(1), 57–144 (2009). https://doi.org/10.1017/S1471068408003645

    Article  MathSciNet  MATH  Google Scholar 

  3. Bondarenko, A., Dung, P.M., Kowalski, R.A., Toni, F.: An abstract, argumentation-theoretic approach to default reasoning. Artif. Intell. 93, 63–101 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bondarenko, A., Toni, F., Kowalski, R.A.: An assumption-based framework for non-monotonic reasoning. In: Logic Programming and Non-monotonic Reasoning, Proceedings of the Second International Workshop, Lisbon, Portugal, June 1993, pp. 171–189. MIT Press (1993)

    Google Scholar 

  5. Cabalar, P., Kaminski, R., Ostrowski, M., Schaub, T.: An ASP semantics for default reasoning with constraints. In: IJCAI International Joint Conference on Artificial Intelligence 2016-January, pp. 1015–1021 (2016)

    Google Scholar 

  6. Gelfond, M., Przymusinska, H., Lifschitz, V., Truszczynski, M., Przymusinska, H., Truszczynski, M.: Disjunctive defaults. In: Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR 1991), Cambridge, MA, USA, 22–25 April 1991, pp. 230–237. Morgan Kaufmann (1991)

    Google Scholar 

  7. Jago, M.: Modelling assumption-based reasoning using contexts. In: Workshop on Context Representation and Reasoning (CRR 2005) (2005)

    Google Scholar 

  8. de Kleer, J.: A general labeling algorithm for assumption-based truth maintenance. In: Proceedings of the 7th National Conference on Artificial Intelligence, St. Paul, MN, USA, 21–26 August 1988, pp. 188–192. AAAI Press/The MIT Press (1988)

    Google Scholar 

  9. Kohlas, J., Anrig, B., Haenni, R., Monney, P.: Model-based diagnostics and probabilistic assumption-based reasoning. Artif. Intell. 104(1–2), 71–106 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kohlas, J., Monney, P.: Probabilistic assumption-based reasoning. In: UAI 1993: Proceedings of the Ninth Annual Conference on Uncertainty in Artificial Intelligence, The Catholic University of America, Providence, Washington, DC, USA, 9–11 July 1993, pp. 485–491. Morgan Kaufmann (1993)

    Google Scholar 

  11. Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: unfounded sets, fixpoint semantics, and computation. Inf. Comput. 135(2), 69–112 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  12. Poole, D.: A logical framework for default reasoning. Artif. Intell. 36(1), 27–47 (1988)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Zhang, S., Zhang, Z., Shen, J.: Constrained default logic programming. In: Proceedings of the International Conference on Logic Programming 2022 Workshops co-located with the 38th International Conference on Logic Programming (ICLP 2022), Haifa, Israel, 31st July–1st August 2022. CEUR Workshop Proceedings, vol. 3193. CEUR-WS.org (2022)

    Google Scholar 

  15. Zhang, Z.: Assumable answer set programming. In: Proceedings of the International Conference on Logic Programming 2022 Workshops co-located with the 38th International Conference on Logic Programming (ICLP 2022), Haifa, Israel, 31st July–1st August 2022. CEUR Workshop Proceedings, vol. 3193. CEUR-WS.org (2022)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Southeast University, Nanjing, Jiangsu, China

    Shutao Zhang & Zhizheng Zhang

Authors
  1. Shutao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhizheng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shutao Zhang .

Editor information

Editors and Affiliations

  1. Peking University, Beijing, China

    Zhi Jin

  2. South China Normal University, Guangzhou, China

    Yuncheng Jiang

  3. Babeș-Bolyai University, Cluj-Napoca, Romania

    Robert Andrei Buchmann

  4. Ulster University, Belfast, UK

    Yaxin Bi

  5. Babeș-Bolyai University, Cluj-Napoca, Romania

    Ana-Maria Ghiran

  6. South China Normal University, Guangzhou, China

    Wenjun Ma

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, S., Zhang, Z. (2023). The Minimal Negated Model Semantics of Assumable Logic Programs. In: Jin, Z., Jiang, Y., Buchmann, R.A., Bi, Y., Ghiran, AM., Ma, W. (eds) Knowledge Science, Engineering and Management. KSEM 2023. Lecture Notes in Computer Science(), vol 14119. Springer, Cham. https://doi.org/10.1007/978-3-031-40289-0_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-40289-0_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-40288-3

  • Online ISBN: 978-3-031-40289-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation