What Next for ASP? (A Not-Entirely-Well-informed Opinion)

摘要

The inception of Answer Set Programming (ASP) can be marked by the appearance of the stable model semantics [GL88], something over 20 years ago. The roots of ASP in turn can be traced to work in nonmonotonic reasoning, notably Default Logic [Rei80]. With the advent of efficient ASP solvers, as exemplified by smodels [NS97] and dlv [ELM~+97], there was a great deal of interest and excitement over the application of ASP (broadly taken) to various problems, along with its use as a modelling tool. Indeed, applications have been proposed in a wide variety of fields, including bioinformatics, configuration, database integration, diagnosis, hardware design, insurance industry applications, model checking, phylogenesis, planning, security protocols, and high-level control of the US space shuttle [Sch08]. In concert with these applications, there has been a widespread flowering of ASP solvers built on various technologies [DVB~+09].