Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,067,231 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
N. Beckwith
,
Kodwo Eshun
,
C.T 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
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
,
G. 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
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
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
A Comparison of Heuristics for Answer Set Programming
Wolfgang Faber
,
G. Pfeifer
2001
Corpus ID: 17329046
Answer Set Programming (ASP) is a novel programming paradig m, which allows to solve problems in a simple and highly declarative…
Expand
2001
2001
Exploiting Vertical Parallelism from Answer Set Programs
Enrico Pontelli
,
Omar 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
2001
2001
Learning by Answer Sets
Chiaki Sakama
ASp
2001
Corpus ID: 7201192
This paper presents a novel application of answer set programming to concept learning in nonmonotonic logic programs. Given an…
Expand
1990
1990
Partial Evaluation for Hierarchies of Logic Theories
M. Bugliesi
,
E. Lamma
,
P. Mello
NACLP
1990
Corpus ID: 9665774
We discuss the impact of Partial Evaluation within the framework of structured logic programming. We define a general scheme for…
Expand