Skip to main content
SpringerLink
Log in
Book cover

Mexican International Conference on Artificial Intelligence

MICAI 2014: Human-Inspired Computing and Its Applications pp 419–430Cite as

Computing Preferred Semantics: Comparing Two ASP Approaches vs an Approach Based on 0-1 Integer Programming

  • Conference paper

  • 1715 Accesses

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

Abstract

Dung’s abstract argumentation frameworks has been object of intense study not just for its relationship with logical reasoning but also for its uses within artificial intelligence. One research branch in abstract argumentation has focused on finding new methods for computing its different semantics. We present a novel method, to the best of our knowledge, for computing preferred semantics using 0-1 integer programming, and also experimentally compare it with two answer set programming approaches. Our results indicate that this new method performed well.

This is a preview of subscription content, 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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bench-Capon, T., Dunne, P.E.: Argumentation in artificial intelligence. Artificial Intelligence 171(10-15), 619–641 (2007), http://www.sciencedirect.com/science/article/pii/S0004370207000793

    Article  MATH  MathSciNet  Google Scholar 

  2. Rahwan, I., Simari, G.R. (eds.): Argumentation in Artificial Intelligence. Springer (2009)

    Google Scholar 

  3. Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77(2), 321–358 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gaggl, S.A., Wallner, J.P., Wolfran, S., Charwat, G., Dvorak, W.: Implementing abstract argumentation: A survey. Institut Fur Information Systeme, Tech. Rep. (2013)

    Google Scholar 

  5. Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers Inc. (2003)

    Google Scholar 

  6. Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)

    Google Scholar 

  7. Brewka, G., Eiter, T., Truszczyński, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)

    Article  Google Scholar 

  8. Toni, F., Sergot, M.: Argumentation and answer set programming. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS, vol. 6565, pp. 164–180. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Preferred Extensions as Minimal Models of Clark’s Completion Semantics, vol. 68 (2013)

    Google Scholar 

  10. Nieves, J.C., Osorio, M., Cortés, U.: Preferred Extensions as Stable Models. Theory and Practice of Logic Programming 8(4), 527–543 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  11. Bell, C., Nerode, A., Ng, R.T., Subrahmanian, V.S.: Mixed integer programming methods for computing nonmonotonic deductive databases. Journal of the ACM 41(6), 1178–1215 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. Egly, U., Alice Gaggl, S., Woltran, S.: Answer-set programming encodings for argumentation frameworks. Argument & Computation 1(2), 147–177 (2010), http://www.tandfonline.com/doi/abs/10.1080/19462166.2010.486479

    Article  Google Scholar 

  13. Osorio, M., Santoyo, A., Diaz, J.: Computing semi-stable semantics of af by 0-1 integer programming. Submitted to LANMR 2014 (2014)

    Google Scholar 

  14. Wolsey, L.A.: Integer Programming. Discrte Mathematics and Optimization. John Wiley & Sons, Inc. (1998)

    Google Scholar 

  15. Caminada, M.W.A., Carnielli, W.A., Dunne, P.E.: Semi-stable semantics. J. Log. Comput. 22(5), 1207–1254 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  16. Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics. Springer (2008); Axler, S. (ed.)

    Google Scholar 

  17. Butenko, S.: Maximum independent set and related problems, with aapplications. Ph.D. dissertation, University of Florida (2003)

    Google Scholar 

  18. Egly, U., Gaggl, S.A., Woltran, S.: ASPARTIX: Implementing argumentation frameworks using answer-set programming. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 734–738. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Calimeri, F., Ianni, G., Ricca, F.: The third open Answer Set Programming competition. CoRR, vol. abs/1206.3 (2012), http://dblp.uni-trier.de/db/journals/corr/corr1206.html#abs-1206-3111

  20. Dvorák, W., Gaggl, S.A., Wallner, J.P., Woltran, S.: Making use of advances in answer-set programming for abstract argumentation systems. CoRR, vol. abs/1108.4942 (2011)

    Google Scholar 

  21. Gabbay, D.M.: Equational approach to argumentation networks. Argument and Computation 3(2-3), 87–142 (2012)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad de las Americas en Puebla, Sta. Catarina Martir, Cholula, Puebla, 72820, Mexico

    Mauricio Osorio, Juan Díaz & Alejandro Santoyo

Authors
  1. Mauricio Osorio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juan Díaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alejandro Santoyo
    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 Computación, Instituto Politécnico Nacional, Av. Juan Dios Bátiz s/n, Col. Nueva Industrial Vallejo, 07738, Mexico City, Mexico

    Alexander Gelbukh

  2. Área Académica de Computación y Electrónica, Carretera Pachuca-Tulancingo, Universidad Autónoma del Estado de Hidalgo, Km. 4.5, Col. Carboneras, Mineral de la Reforma, 42180, Hidalgo, Mexico

    Félix Castro Espinoza

  3. Facultad de ciencias, Universidad Autónoma Nacional de México, Ciudad Universitaria, México DF, Mexico

    Sofía N. Galicia-Haro

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Osorio, M., Díaz, J., Santoyo, A. (2014). Computing Preferred Semantics: Comparing Two ASP Approaches vs an Approach Based on 0-1 Integer Programming. In: Gelbukh, A., Espinoza, F.C., Galicia-Haro, S.N. (eds) Human-Inspired Computing and Its Applications. MICAI 2014. Lecture Notes in Computer Science(), vol 8856. Springer, Cham. https://doi.org/10.1007/978-3-319-13647-9_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13647-9_38

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13646-2

  • Online ISBN: 978-3-319-13647-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation