Skip to main content

Partial Preferences and Ambiguity Resolution in Contextual Defeasible Logic

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2011)

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

Abstract

Domains, such as Ambient Intelligence and Social Networks, are characterized by some common features including distribution of the available knowledge, entities with different backgrounds, viewpoints and operational environments, and imperfect knowledge. Multi-Context Systems (MCS) has been proposed as a natural representation model for such environments, while recent studies have proposed adding non-monotonic features to MCS to address the issues of incomplete, uncertain and ambiguous information. In previous works, we introduced a non-monotonic extension to MCS and an argument-based reasoning model that handle imperfect context information based on defeasible argumentation. Here we propose alternative variants that integrate features such as partial preferences, ambiguity propagating and team defeat, and study the relations between the different variants in terms of conclusions being drawn in each case.

This work was carried out during the tenure of an ERCIM ”Alain Bensoussan” Fellowship Programme.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Giunchiglia, F., Serafini, L.: Multilanguage Hierarchical Logics or: How we can do Without Modal Logics. Artificial Intelligence 65(1), 29–70 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ghidini, C., Giunchiglia, F.: Local Models Semantics, or contextual reasoning = locality + compatibility. Artificial Intelligence 127(2), 221–259 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Roelofsen, F., Serafini, L.: Minimal and Absent Information in Contexts. In: IJCAI, pp. 558–563 (2005)

    Google Scholar 

  4. Brewka, G., Roelofsen, F., Serafini, L.: Contextual Default Reasoning. In: IJCAI, pp. 268–273 (2007)

    Google Scholar 

  5. Bikakis, A., Antoniou, G.: Contextual Argumentation in Ambient Intelligence. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 30–43. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Bikakis, A., Antoniou, G.: Defeasible Contextual Reasoning with Arguments in Ambient Intelligence. IEEE TKDE 22(11), 1492–1506 (2010)

    Google Scholar 

  7. Antoniou, G., Bikakis, A., Papatheodorou, C.: Reasoning with Imperfect Context and Preference Information in Multi-Context Systems. In: Catania, B., Ivanović, M., Thalheim, B. (eds.) ADBIS 2010. LNCS, vol. 6295, pp. 1–12. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Antoniou, G., Billington, D., Governatori, G., Maher, M.J., Rock, A.: A Family of Defeasible Reasoning Logics and its Implementation. In: ECAI, pp. 459–463 (2000)

    Google Scholar 

  9. Governatori, G., Maher, M.J., Antoniou, G., Billington, D.: Argumentation Semantics for Defeasible Logic. Journal of Logic and Computation 14(5), 675–702 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Brewka, G., Eiter, T.: Argumentation Context Systems: A Framework for Abstract Group Argumentation. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 44–57. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Thimm, M., Kern-Isberner, G.: A Distributed Argumentation Framework using Defeasible Logic Programming. In: COMMA, pp. 381–392. IOS Press, Amsterdam (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bikakis, A., Antoniou, G. (2011). Partial Preferences and Ambiguity Resolution in Contextual Defeasible Logic. In: Delgrande, J.P., Faber, W. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2011. Lecture Notes in Computer Science(), vol 6645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20895-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20895-9_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20894-2

  • Online ISBN: 978-3-642-20895-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics