Lably
Skip to content

Answer set programming

Programming paradigm focused on difficult search problems

  • 19 min read
  • 6 chapters

Related on Lably

Through Logic programming, Graph (discrete mathematics) and Trial and error

Lab · Class 6–10Rule-based vs Learning SystemsLab · Class 6–12AI & Python Builds (Medha AI)Lab · Class 8–11Chatbot BuilderLab · Class 8–12Algorithms & Sorting

In a more general sense, ASP includes all applications of answer sets to knowledge representation and reasoning and the use of Prolog-style query evaluation for solving problems arising in these applications.

History

An early example of answer set programming was the planning method proposed in 1997 by Dimopoulos, Nebel and Köhler. Their approach is based on the relationship between plans and stable models. In 1998 Soininen and Niemelä applied what is now known as answer set programming to the problem of product configuration. In 1999, the term "answer set programming" appeared for the first time in a book The Logic Programming Paradigm as the title of a collection of two papers. The first of these papers identified the use of answer set solvers for search as a new programming paradigm. That same year Niemelä also proposed "logic programs with stable model semantics" as a new paradigm.

Sign in to keep reading

5 more chapters are free with a Lably account.

More in Computing and communication

ISBNUnique numeric book identifier since 1970X (social network)American social networking serviceWayback MachineDigital archive by the Internet ArchivePython (programming language)General-purpose programming languageMacOSOperating system for Apple computersUnicodeCharacter encoding standard