Skip to main content
SpringerLink
Log in

Possibilistic Well-Founded Semantics

  • Conference paper
MICAI 2009: Advances in Artificial Intelligence (MICAI 2009)

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

Included in the following conference series:

Abstract

Recently, a good set of logic programming semantics has been defined for capturing possibilistic logic program. Practically all of them follow a credulous reasoning approach. This means that given a possibilistic logic program one can infer a set of possibilistic models. However, sometimes it is desirable to associate just one possibilistic model to a given possibilistic logic program. One of the main implications of having just one model associated to a possibilistic logic program is that one can perform queries directly to a possibilistic program and answering these queries in accordance with this model.

In this paper, we introduce an extension of the Well-Founded Semantics, which represents a sceptical reasoning approach, in order to capture possibilistic logic programs. We will show that our new semantics can be considered as an approximation of the possibilistic semantics based on the answer set semantics and the pstable semantic. A relevant feature of the introduced semantics is that it is polynomial time computable.

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. Aulinas, M.: Management of industrial wastewater discharges through agents’ argumentation. PhD thesis, PhD on Environmental Sciences, University of Girona, to be presented

    Google Scholar 

  2. Aulinas, M., Nieves, J.C., Poch, M., Cortés, U.: Supporting Decision Making in River Basin Systems Using a Declarative Reasoning Approach. In: Finkel, M., Grathwohl, P. (eds.) Proceedings of the AquaTerra Conference (Scientific Fundamentals for River Basic Management), March 2009, p. 75 (2009) ISSN 0935-4948

    Google Scholar 

  3. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  4. Brass, S., Zukowski, U., Freitag, B.: Transformation-based bottom-up computation of the well-founded model. In: NMELP, pp. 171–201 (1996)

    Google Scholar 

  5. Dix, J.: A classification theory of semantics of normal logic programs: II. weak properties. Fundam. Inform. 22(3), 257–288 (1995)

    MATH  MathSciNet  Google Scholar 

  6. Dix, J., Osorio, M., Zepeda, C.: A general theory of confluent rewriting systems for logic programming and its applications. Ann. Pure Appl. Logic 108(1-3), 153–188 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Gabbay, D., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, Nonmonotonic Reasoning and Uncertain Reasoning, vol. 3, pp. 439–513. Oxford University Press, Oxford (1994)

    Google Scholar 

  8. Gelder, A.V., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620–650 (1991)

    MATH  Google Scholar 

  9. Mendelson, E.: Introduction to Mathematical Logic, 4th edn. Chapman and Hall/CRC, Boca Raton (1997)

    MATH  Google Scholar 

  10. Nicolas, P., Garcia, L., Stéphan, I., Lafévre, C.: Possibilistic Uncertainty Handling for Answer Set Programming. Annals of Mathematics and Artificial Intelligence 47(1-2), 139–181 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Nieves, J.C., Osorio, M., Cortés, U.: Semantics for possibilistic disjunctive programs. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 315–320. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Nieves, J.C., Osorio, M., Cortés, U.: Semantics for possibilistic disjunctive programs. In: Costantini, S., Watson, R. (eds.) Answer Set Programming: Advances in Theory and Implementation, pp. 271–284 (2007)

    Google Scholar 

  13. Osorio, M., Nieves, J.C.: Pstable semantics for possibilistic logic programs. In: Gelbukh, A., Kuri Morales, Á.F. (eds.) MICAI 2007. LNCS (LNAI), vol. 4827, pp. 294–304. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CENTIA, Universidad de las Américas - Puebla, Sta. Catarina Mártir, Cholula, Puebla, 72820, México

    Mauricio Osorio

  2. Software Department (LSI), Universitat Politècnica de Catalunya, c/Jordi Girona 1-3, E08034, Barcelona, Spain

    Juan Carlos Nieves

Authors
  1. Mauricio Osorio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juan Carlos Nieves
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centro de Investigación en Matemáticas, AC. (CIMAT), Area de Computación, Calle Jalisco S/N, Mineral de Valenciana, Guanajuato, CP 36250, Guanajuato, México

    Arturo Hernández Aguirre

  2. Ciencias de la Computación, Tecnológico de Monterrey, Campus Estado de México, Carretera al lago de Guadalupe Km 3,5, Col. Margarita Maza de Juárez, Atizapán de Zaragoza,, CP 52926, Estado de México, México

    Raúl Monroy Borja

  3. Instituto Nacional de Astrofísica, Optica y Electrónica (INAOE), Ciencias Computacionales, Luis Enrique Erro No. 1, Santa María Tonantzintla, CP 72840, Puebla, México

    Carlos Alberto Reyes Garciá

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Osorio, M., Nieves, J.C. (2009). Possibilistic Well-Founded Semantics. In: Aguirre, A.H., Borja, R.M., Garciá, C.A.R. (eds) MICAI 2009: Advances in Artificial Intelligence. MICAI 2009. Lecture Notes in Computer Science(), vol 5845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05258-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-05258-3_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05257-6

  • Online ISBN: 978-3-642-05258-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation