Skip to main content
Springer Nature Link
Log in

Pstable Semantics for Logic Programs with Possibilistic Ordered Disjunction

  • Conference paper
AI*IA 2009: Emergent Perspectives in Artificial Intelligence (AI*IA 2009)

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

Included in the following conference series:

  • 843 Accesses

Abstract

In this paper we define the semantics for capturing possibilistic ordered disjunction programs based on pstable semantics. The pstable semantics, based on paraconsistent logic, allows to treat inconsistency programs. Moreover being closer to possibilistic inference it allows to extend the necessity-values of the clauses to be considered, causing a higher level of comparison at the moment of selecting preferred pstable models of a possibilistic ordered disjunction programs. We compare the possibilistic pstable semantics for ordered disjunction programs with the recently defined possibilistic answer set semantics for the same class of 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

    MATH  Google Scholar 

  2. Brewka, G., Niemelä, I., Syrjänen, T.: Logic Programs with Ordered Disjunction. Computational Intelligence 20(2), 333–357 (2004)

    Article  Google Scholar 

  3. Confalonieri, R., Nieves, J.C., Vázquez-Salceda, J.: Logic Programs with Possibilistic Ordered Disjunction. Research Report LSI-09-19-R, UPC - LSI (2009)

    Google Scholar 

  4. Dubois, D., Lang, J., Prade, H.: Possibilistic Logic. In: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 439–513. Oxford University Press, Oxford (1994)

    Google Scholar 

  5. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9(3/4), 365–386 (1991)

    Article  Google Scholar 

  6. 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 

  7. Osorio, M., Arrazola Ramírez, J.R., Carballido, J.L.: Logical Weak Completions of Paraconsistent Logics. Journal of Logic and Computation 18(6), 913–940 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Osorio, M., Pérez, J.A.N., Ramírez, J.R.A., Macías, V.B.: Logics with Common Weak Completions. Journal of Logic and Computation 16(6), 867–890 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, C/ Jordi Girona Salgado 1-3, E - 08034, Barcelona

    Roberto Confalonieri, Juan Carlos Nieves & Javier Vázquez-Salceda

Authors
  1. Roberto Confalonieri
    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

  3. Javier Vázquez-Salceda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento de Science Sociali, Cognitive e Quantitative, University of Modena and Reggio Emilia, Via Allegri 9, 42100, Reggio Emilia, Italia

    Roberto Serra

  2. Dipartimento di Ingegneria dell‘Informazione, Università degli Studi di Modena, Via Vignolese 905, 41100, Modena, Italy

    Rita Cucchiara

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Confalonieri, R., Nieves, J.C., Vázquez-Salceda, J. (2009). Pstable Semantics for Logic Programs with Possibilistic Ordered Disjunction. In: Serra, R., Cucchiara, R. (eds) AI*IA 2009: Emergent Perspectives in Artificial Intelligence. AI*IA 2009. Lecture Notes in Computer Science(), vol 5883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10291-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10291-2_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10290-5

  • Online ISBN: 978-3-642-10291-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics