Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,245,750 papers from all fields of science
Search
Sign In
Create Free Account
Answer set programming
Known as:
Answer set program
, Answer-set programming
, AnsProlog
Expand
Answer set programming (ASP) is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Abductive logic programming
Action language
Automated planning and scheduling
Clique (graph theory)
Expand
Broader (1)
Logic programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Question & Answer 1
Naomi Beckwith
,
Kodwo Eshun
,
C. Hanks
,
Aisha Motlani
,
Anjalika Sagar
2014
Corpus ID: 190355767
From “Black Collectivities: A Conference,” held May 3–4, 2013, at Northwestern University’s Mary and Leigh Block Museum of Art…
Expand
2010
2010
An Answer Set Programming System with Cycle Breaking Heuristic: An Answer Set Programming System with Cycle Breaking Heuristic
Yuping Shen
,
Xi-Shun Zhao
2010
Corpus ID: 57685228
: Answer set programming (ASP) is a logic programming paradigm under answer set semantics, which can be utilized in the field of…
Expand
2007
2007
A characterization of answer sets for logic programs
Mingyi Zhang
,
Y. Zhang
,
Fang-Zhen Lin
Science in China Series F: Information Sciences
2007
Corpus ID: 13040786
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…
Expand
2005
2005
Updates in Answer Set Programming based on structural properties
Fernando Zacaŕias
,
M. Osorio
,
J. Guadarrama
2005
Corpus ID: 17011851
Revising and updating knowledge bases is an important issue in knowledge representation and reasoning. Various proposals have…
Expand
2004
2004
Undergraduate Dissertation: Incremental Answer Set Programming
Martin Brain
2004
Corpus ID: 61325878
This document presents a series of algorithms for computing the answer sets of an AnsProlog programs. They focus on the efficient…
Expand
2003
2003
Computing Preferred Answer Sets in Answer Set Programming
T. Wakaki
,
Katsumi Inoue
,
Chiaki Sakama
,
K. Nitta
Logic Programming and Automated Reasoning
2003
Corpus ID: 42582726
Prioritized logic programs (PLPs) have a mechanism of representing priority knowledge in logic programs. The declarative…
Expand
2003
2003
Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming
Thomas Eiter
,
Wolfgang Faber
,
Michael Fink
,
Gerald Pfeifer
,
S. Woltran
ASp
2003
Corpus ID: 6953237
We present new complexity results on answer set checking for non-ground programs under a variety of syntactic restrictions. For…
Expand
2001
2001
Answer Set Programming and Bounded Model Checking
Keijo Heljanko
,
I. Niemelä
ASp
2001
Corpus ID: 15862985
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer…
Expand
2001
2001
On the Foundations of Answer Set Programming
V. Marek
,
J. Remmel
ASp
2001
Corpus ID: 7323685
Schlipf (Schlipf 1995) proved that the Stable Logic Programming solves all NP decision problems. We extend Schlipf’s result to…
Expand
2001
2001
Exploiting Vertical Parallelism from Answer Set Programs
Enrico Pontelli
,
O. El-Khatib
ASp
2001
Corpus ID: 18432472
In the last ten years we witnessed a rapid development of alternative logical systems, called non-monotonic logics (Baral…
Expand