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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
tation and reasoning (KR) paradigm. It has rich highlevel representation languages that allow recursive definitions, aggregates… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We introduce the first approach to Reactive Answer Set Programming, aiming at reasoning about real-time dynamic systems running… (More)
  • table 1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
The addition of aggregates has been one of the most relevant enhanceme nts to the language of answer set programming (ASP). They… (More)
  • table 1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
The motivation and key concepts behind answer set programming---a promising approach to declarative problem solving. 
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We introduce a knowledge representation language ${\cal AC(C)}$ extending the syntax and semantics of ASP and CR-Prolog, give… (More)
Is this relevant?
2008
2008
To compute a function such as a mapping from vertices to colors in the graph coloring problem, current practice in Answer Set… (More)
  • table 2
  • table 3
  • table 4
  • table 1
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
2006
2006
We present Annotated Answer Set Programming, that extends the expressive power of disjunctive logic programming with annotation… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond… (More)
Is this relevant?
2001
2001
We study the notion of strong equivalence between two Answer Set programs and we show how some particular cases of testing strong… (More)
Is this relevant?