Skip to main content
SpringerLink
Log in

Solving Disjunctive Fuzzy Answer Set Programs

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 2015)

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

Abstract

Fuzzy Answer Set Programming (FASP) is an extension of the popular Answer Set Programming (ASP) paradigm which is tailored for continuous domains. Despite the existence of several prototype implementations, none of the existing solvers can handle disjunctive rules in a sound and efficient manner. We first show that a large class of disjunctive FASP programs called the self-reinforcing cycle-free (SRCF) programs can be polynomially reduced to normal FASP programs. We then introduce a general method for solving disjunctive FASP programs, which combines the proposed reduction with the use of mixed integer programming for minimality checking. We also report the result of the experimental benchmark of this method.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Notes

  1. 1.

    The symbol \(\overline{c}\) for a numeric value c represents a truth-value constant in a program.

  2. 2.

    Note that by \(\mathcal {L}\) here, we mean the “set” part of the lattice \(\mathcal {L}\).

  3. 3.

    https://github.com/mushthofa/ffasp.

  4. 4.

    https://projects.coin-or.org/Cbc.

References

  1. Alviano, M., Peñaloza, R.: Fuzzy answer sets approximations. Theor. Pract. Logic Program. 13(4–5), 753–767 (2013)

    Article  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  3. Ben-Eliyahu, R., Dechter, R.: Propositional semantics for disjunctive logic programs. Ann. Math. Artif. Intell. 12(1–2), 53–87 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Blondeel, M., Schockaert, S., Vermeir, D., De Cock, M.: Fuzzy answer set programming: an introduction. In: Yager, R.R., Abbasov, A.M., Reformat, M., Shahbazova, S.N. (eds.) Soft Computing: State of the Art Theory. STUDFUZZ, vol. 291, pp. 209–222. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Blondeel, M., Schockaert, S., Vermeir, D., De Cock, M.: Complexity of fuzzy answer set programming under Łukasiewicz semantics. Int. J. Approximate Reasoning 55(9), 1971–2003 (2014)

    Article  MATH  Google Scholar 

  6. Viegas Damásio, C., Moniz Pereira, L.: Antitonic logic programs. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 379–393. Springer, Heidelberg (2001)

    Google Scholar 

  7. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374–425 (2001)

    Article  Google Scholar 

  8. Dix, J., Gottlob, G., Marek, W.: Reducing disjunctive to non-disjunctive semantics by shift-operations. Fundamenta Informaticae 28(1), 87–100 (1996)

    MATH  MathSciNet  Google Scholar 

  9. Eiter, T., Faber, W., Mushthofa, M.: Space efficient evaluation of ASP programs with bounded predicate arities. In: 24th AAAI Conference on Artificial Intelligence, pp. 303–308 (2010)

    Google Scholar 

  10. Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM Trans. Database Syst. 22(3), 364–418 (1997)

    Article  Google Scholar 

  11. Eiter, T., Ianni, G., Krennwallner, T.: Answer set programming: a primer. In: Tessaris, S., Franconi, E., Eiter, T., Gutierrez, C., Handschuh, S., Rousset, M.-C., Schmidt, R.A. (eds.) Reasoning Web. LNCS, vol. 5689, pp. 40–110. Springer, Heidelberg (2009)

    Google Scholar 

  12. Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: DLVHEX: a prover for semantic-web reasoning under the answer-set semantics. In: Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence, pp. 1073–1074 (2006)

    Google Scholar 

  13. Erdem, E.: Theory and Applications of Answer Set Programming. Ph.D. thesis. the University of Texas at Austin (2002)

    Google Scholar 

  14. Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: the Potsdam answer set solving collection. AI Commun. 24(2), 107–124 (2011)

    MATH  MathSciNet  Google Scholar 

  15. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the Fifth International Conference and Symposium on Logic Programming, vol. 88, pp. 1070–1080 (1988)

    Google Scholar 

  16. Hähnle, R.: Proof theory of many-valued logic-linear optimization-logic design: connections and interactions. Soft Comput. 1(3), 107–119 (1997)

    Article  Google Scholar 

  17. Jeroslow, R.G.: Logic-Based Decision Support: Mixed Integer Model Formulation. Elsevier, Amsterdam (1989)

    MATH  Google Scholar 

  18. Lee, J., Wang, Y.: Stable models of fuzzy propositional formulas. In: Fermé, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 326–339. Springer, Heidelberg (2014)

    Google Scholar 

  19. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Logic 7(3), 499–562 (2006)

    Article  MathSciNet  Google Scholar 

  20. Lifschitz, V.: What is answer set programming? In: Proceedings of the 23rd AAAI Conference in Artificial Intelligence, vol. 8, pp. 1594–1597 (2008)

    Google Scholar 

  21. Lifschitz, V., Turner, H.: Splitting a logic program. In: Proceedings of the 11th International Conference on Logic Programming, pp. 23–37 (1994)

    Google Scholar 

  22. Loyer, Y., Straccia, U.: Epistemic foundation of stable model semantics. Theor. Pract. Logic Program. 6(4), 355–393 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  23. Lukasiewicz, T., Straccia, U.: Tightly integrated fuzzy description logic programs under the answer set semantics for the semantic web. In: Marchiori, M., Pan, J.Z., Marie, C.S. (eds.) RR 2007. LNCS, vol. 4524, pp. 289–298. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  24. Madrid, N., Ojeda-Aciego, M.: Measuring inconsistency in fuzzy answer set semantics. IEEE Trans. Fuzzy Syst. 19(4), 605–622 (2011)

    Article  Google Scholar 

  25. Mushthofa, M., Schockaert, S., De Cock, M.: A finite-valued solver for disjunctive fuzzy answer set programs. In: Proceedings of European Conference in Artificial Intelligence 2014, pp. 645–650 (2014)

    Google Scholar 

  26. Oikarinen, E., Janhunen, T.: Achieving compositionality of the stable model semantics for smodels programs. Theor. Pract. Logic Program. 8(5–6), 717–761 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  27. Ross, K.A.: Modular stratification and magic sets for datalog programs with negation. In: Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 161–171 (1990)

    Google Scholar 

  28. Schockaert, S., Janssen, J., Vermeir, D.: Fuzzy equilibrium logic: declarative problem solving in continuous domains. ACM Trans. Comput. Logic 13(4), 33:1–33:39 (2012)

    Article  MathSciNet  Google Scholar 

  29. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1998)

    MATH  Google Scholar 

  30. Van Nieuwenborgh, D., De Cock, M., Hadavandi, E.: Fuzzy answer set programming. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 359–372. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Computer Science and Statistics, Ghent University, Ghent, Belgium

    Mushthofa Mushthofa & Martine De Cock

  2. School of Computer Science and Informatics, Cardiff University, Cardiff, UK

    Steven Schockaert

  3. Department of Computer Science, Bogor Agricultural University, Bogor, Indonesia

    Mushthofa Mushthofa

  4. Center for Data Science, University of Washington Tacoma, Tacoma, USA

    Martine De Cock

Authors
  1. Mushthofa Mushthofa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steven Schockaert
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martine De Cock
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mushthofa Mushthofa .

Editor information

Editors and Affiliations

  1. University of Calabria, Rende, Italy

    Francesco Calimeri

  2. University of Calabria, Rende, Italy

    Giovambattista Ianni

  3. University of Kentucky Dept. Computer Science, Lexington, Kentucky, USA

    Miroslaw Truszczynski

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Mushthofa, M., Schockaert, S., De Cock, M. (2015). Solving Disjunctive Fuzzy Answer Set Programs. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2015. Lecture Notes in Computer Science(), vol 9345. Springer, Cham. https://doi.org/10.1007/978-3-319-23264-5_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23264-5_38

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23263-8

  • Online ISBN: 978-3-319-23264-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation