Computer Science Stack Exchange
Computer Science Stack Exchange

Questions tagged [answer-set-programming]

ASP (Answer Set Programming) is a form of declarative programming oriented towards NP-hard search problems

Answer set programming is a form of declarative programming based on the answer set (stable model) semantics of logic programming . It is oriented towards NP-hard search problems.

8 questions
6
votes
1 answer

What is an $NP^{NP}$-complete problem?

So in this paper I'm reading (https://adamsmith.as/papers/fdg2013_shortcuts.pdf), the authors talk about an $NP^{NP}$-complete problem, in relation to Answer Set Programming. I know what P, NP, etc. are but I don't unerstand what they mean with…
Wouter Florijn
  • 215
  • 1
  • 6
5
votes
1 answer

How logic programming (especially ASP) is related to the reasoning in (first-order) logic?

How logic programming (https://en.wikipedia.org/wiki/Logic_programming, especially answer set programming) is related to the reasoning in the (first-order) logic? Maybe logic programming can be expressed using lambda calculus and then this…
TomR
  • 1,411
  • 8
  • 17
4
votes
0 answers

Why Is Alloy not an Answer Set Programming system?

Alloy's front page doesn't mention ASP, but the description sounds like ASP (finding solutions consistent with a logical spec). And Alloy isn't listed in the Wikipedia ASP article. Yet ASP systems and Alloy both seem to built on top of SAT…
andrew cooke
  • 153
  • 5
4
votes
1 answer

Abduction in ASP

Well, forgive my ignorance about the matter as I have been playing with ASP for the last couple of days. Consider this simple example p. s :- p. And the corresponding output generated after running the program in clingo: $ ./clingo.exe ex.lp…
astazed
  • 151
  • 3
4
votes
0 answers

Answer Set Program to SAT translation

During the presentation (a talk) Answer Set Programming: Boolean Constraint Solving for Knowledge Representation and Reasoning Torsten Schaub (University of Postdam) stated around twenty-one minutes into the talk, "You can't translate an ASP (answer…
Pushpa
  • 943
  • 6
  • 12
2
votes
1 answer

Explanation of the Gelfond Lifschitz reduct

Can someone explain with a hands on example how the Gelfond Lifschitz reduct works in order to check stable model semantics? edit a simple example here - at least as far as I understand the thing. So far grounding is clear to me - but the the…
Georg Heiler
  • 131
  • 5
2
votes
0 answers

Guarantee the solvability of conditional, but cyclic dependencies

I have a bunch of values, some that are given by an end user input and some that are calculated based on that input. The way that the values are calculated are input by a different group of users of the software. My goal is to give the second group…
SourceOverflow
  • 121
  • 1
0
votes
0 answers

Given an answer set program X how do you identify an answer set for X

How do you identify the answer sets for II if you know what the answer set program II looks like? Here is the problem: The answer is suppose to be 1 and 3. Here is what I am thinking, starting with looking at number 1: Okay so we got loc(1,ted,…
Programming_Zeus
  • 101
  • 1