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)

Related topics

Related topics

33 relations
Abductive logic programmingAction languageAutomated planning and schedulingClique (graph theory)

Broader (1)

Logic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Question & Answer 1
From “Black Collectivities: A Conference,” held May 3–4, 2013, at Northwestern University’s Mary and Leigh Block Museum of Art… 
2010
2010
Situation Calculus as Answer Set Programming
We show how the situation calculus can be reformulated in terms of the first-order stable model semantics. A further… 
2010
2010
Communicating Answer Set Programs
Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving… 
2009
2009
Towards Predicate Answer Set Programming via Coinductive Logic Programming
Answer Set Programming (ASP) is a powerful paradigm based on logic programming for non-monotonic reasoning. Current ASP… 
2004
2004
Enhancing answer set programming with templates
The work aims at extending Answer Set Programming (ASP) with the possibility of quickly introducing new predefined constructs and… 
2004
2004
Undergraduate Dissertation: Incremental Answer Set Programming
This document presents a series of algorithms for computing the answer sets of an AnsProlog programs. They focus on the efficient… 
2003
2003
Integrating Description Logics and Answer Set Programming
We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support… 
2003
2003
Computing Preferred Answer Sets in Answer Set Programming
Prioritized logic programs (PLPs) have a mechanism of representing priority knowledge in logic programs. The declarative… 
2001
2001
Answer Set Programming and Bounded Model Checking
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer… 
2001
2001
On the Foundations of Answer Set Programming
Schlipf (Schlipf 1995) proved that the Stable Logic Programming solves all NP decision problems. We extend Schlipf’s result to… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)