Skip to search formSkip to main contentSkip to account menu

Answer set programming

Known as: Answer set program, Answer-set programming, AnsProlog 
Answer set programming (ASP) is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
From “Black Collectivities: A Conference,” held May 3–4, 2013, at Northwestern University’s Mary and Leigh Block Museum of Art… 
2010
2010
: Answer set programming (ASP) is a logic programming paradigm under answer set semantics, which can be utilized in the field of… 
2007
2007
Checking if a program has an answer set, and if so, compute its answer sets are just some of the important problems in answer set… 
2005
2005
Revising and updating knowledge bases is an important issue in knowledge representation and reasoning. Various proposals have… 
2004
2004
This document presents a series of algorithms for computing the answer sets of an AnsProlog programs. They focus on the efficient… 
2003
2003
Prioritized logic programs (PLPs) have a mechanism of representing priority knowledge in logic programs. The declarative… 
2003
2003
We present new complexity results on answer set checking for non-ground programs under a variety of syntactic restrictions. For… 
2001
2001
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer… 
2001
2001
Schlipf (Schlipf 1995) proved that the Stable Logic Programming solves all NP decision problems. We extend Schlipf’s result to… 
2001
2001
In the last ten years we witnessed a rapid development of alternative logical systems, called non-monotonic logics (Baral…