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.
2012
2012
We address the problem of the automatic synthesis of concurrent programs within a framework based on Answer Set Programming ASP… 
2010
2010
Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving… 
2010
2010
We study the problem of reasoning from incoherent answer set programs, i.e., from logic programs that do not have an answer set… 
2009
2009
Recently, Ferraris, Lee and Lifschitz presented a general definition of a stable model that is similar to the definition of… 
2009
2009
An automated design approach for multiprocessor systems on FPGAs is presented which customizes architectures for parallel… 
2004
2004
The work aims at extending Answer Set Programming (ASP) with the possibility of quickly introducing new predefined constructs and… 
2004
2004
In this paper our goal is to bridge two popular and wellstudied knowledge representation formalisms: description logics (DLs… 
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 integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support…