Answer Set Programming in a Nutshell

1 pages•Published: July 28, 2013

Abstract

Answer Set Programming (ASP) has emerged in the recent years as a powerful paradigm for declarative problem solving, which has its roots in knowledge representation and non-monotonic logic programming. Similar to SAT solving, the basic idea is to encode solutions to a problem in the models of a non-monotonic logic program, which can be computed by reasoning engines off the shelf. ASP is particularly well-suited for modeling and solving problems which involve common sense reasoning or transitive closure, and has been fruitfully applied to a growing range of applications. Among the latter are also problems in testing and verfication, for which efficient core fragments of ASP that embrace Datalog haven been exploited. This talk gives a brief introduction to ASP, covering the basic concepts, some of its properties and features, and solvers. It further addresses some applications in the context of verification and recent developments in ASP, which bring evaluation closer to other formalisms and logics.

In: Laura Kovacs and Temur Kutsia (editors). WWV 2010. 6th International Workshop on Automated Specification and Verification of Web Systems, vol 18, pages 1.

Links:	https://easychair.org/publications/paper/jB
	https://doi.org/10.29007/tmt3

BibTeX entry

@inproceedings{WWV2010:Answer_Set_Programming_Nutshell,
  author    = {Thomas Eiter},
  title     = {Answer Set Programming in a Nutshell},
  booktitle = {WWV 2010. 6th International Workshop on Automated Specification and Verification of Web Systems},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {18},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/jB},
  doi       = {10.29007/tmt3},
  pages     = {1},
  year      = {2013}}

Download PDF Open PDF in browser