Skip to main content

Part of the book series: Atlantis Computational Intelligence Systems ((ATLANTISCIS,volume 5))

  • 476 Accesses

Abstract

With the ever-growing importance of computers in our modern-day society, the need for languages that allow to quickly write non-defective programs instructing these machines is pressing. While programming languages have come a long way since the days of punched cards, the large number of errors in current software shows that we have not yet attained this goal. A growing trend in computer science is to solve problems using a language-oriented approach. The idea is that instead of solving a problem in a general-purpose programming language such as Java or Haskell, we first create a domain-specific language that is very close to the problem domain and then model the problem in this high-level language. The advantage of this approach is that programs can be written much faster and that it becomes easier to spot differences between the implementation and the intentions of the programmer. One such domain-specific language is answer set programming (ASP). ASP is a declarative programming language with roots in logic programming that allows to model combinatorial optimization problems in a concise and elegant manner. Among others it has been used to implement planning problems, configuration optimizations and decision support systems. Furthermore it has also been used as an intermediate language for other domain-specific languages, such as those used for modeling biological networks. However, while ASP provides a rich language for modeling combinatorial problems, it is not directly suitable for modeling problems with continuous domains. Such problems occur naturally in diverse fields such as the design of gas and electricity networks, computer vision, business process management and investment portfolios. To overcome this problem, we studied the combination of ASP with fuzzy logic—a class of multi-valued logics that can handle continuity. The resulting formalism is called fuzzy answer set programming (FASP). After a short chapter that recalled some preliminary notions on ASP and fuzzy logic we described FASP in Chap. 3.

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 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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jeroen Janssen .

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Atlantis Press

About this chapter

Cite this chapter

Janssen, J., Schockaert, S., Vermeir, D., de Cock, M. (2012). Conclusions. In: Answer Set Programming for Continuous Domains: A Fuzzy Logic Approach. Atlantis Computational Intelligence Systems, vol 5. Atlantis Press. https://doi.org/10.2991/978-94-91216-59-6_7

Download citation

  • DOI: https://doi.org/10.2991/978-94-91216-59-6_7

  • Published:

  • Publisher Name: Atlantis Press

  • Print ISBN: 978-94-91216-58-9

  • Online ISBN: 978-94-91216-59-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships