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… 
2013
2013
Integrating Temporal Extensions of Answer Set Programming
In this paper we study the relation between the two main extensions of Answer Set Programming with temporal modal operators… 
2010
2010
Extending OWL with Integrity Constraints
Since m1 and m2 are not explicitly defined to be different from each other, they will be inferred to be same due to the… 
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
Computing Preferred Answer Sets in Answer Set Programming
Prioritized logic programs (PLPs) have a mechanism of representing priority knowledge in logic programs. The declarative… 
2003
2003
Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming
We present new complexity results on answer set checking for non-ground programs under a variety of syntactic restrictions. For… 
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… 
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
Exploiting Vertical Parallelism from Answer Set Programs
In the last ten years we witnessed a rapid development of alternative logical systems, called non-monotonic logics (Baral… 
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)