CH 12 ASP

Consider the following program P: p :- not p, s, t. p. s. t. no answer set 1 answer set: { } 1 answer set: { p. } 1 answer set: { not p. } 1 answer set: { s, t } 1 answer set: { p, s, t }

1 answer set: { p, s, t }

[ASP] move-win. Consider the following program P. What is its answer set(s)? win(X) :- move(X,Y), not win(Y). move(a,b). move(b,c). No answer set 1 answer set: { } 1 answer set: { win(a). } 1 answer set: { win(b). } 1 answer set: { win(a). win(c). } 2 answer sets: { win(a). }, { win(b). } 2 answer sets: { win(a). win(c). }, { win(b). } 3 answer sets: { win(a). }, { win(b). }, { win(c). }

1 answer set: { win(b). }

Consider the following program P. What is its answer set(s)? p :- not p, s, t. no answer set 1 answer set: { } 1 answer set: { p. } 1 answer set: { not p. } 1 answer set: { s, t }

1 answer set: { }

Which one of the following statements is NOT correct? Herbrand Universe of a program P is the set of ground terms constructed from function symbols and constants occurring in the program P. Herbrand Base of a program P is the set of ground atoms constructed from predicate symbols and ground terms from the Herbrand Universe. Herbrand Interpretation of a program P is the set of ground rules and facts constructed from Herbrand Base of P. Herbrand Model of a program P is an instance of Herbrand Interpretation of P which is a model of P. Herbrand Model of a program P is the subset of the Herbrand Interpretation of P, entailing P.

Herbrand Model of a program P is the subset of the Herbrand Interpretation of P, entailing P.

[ASP] simple program. Consider the following program P, what is its answer set? p ← not p. One answer: { p } One answer: { q } Two answers: { p }, { q } No answer One answer: { }

No answer

[ASP] move-win. Consider the following program P, what is its answer set? P = { win(X) :- move(X,Y), not win(Y). move(a,b). } One answer: { } One answer: { win(a) } One answer: { win(b) } One answer: { win(a), win(b) } Two answers: { win(a) }, { win(b) } No answer

One answer: { win(a) }

Consider the following program P, what is its answer set? P = { win(X) :- move(X,Y), not win(Y). move(a,b). move(b,c). } One answer: { } One answer: { win(a) } One answer: { win(b) } One answer: { win(a), win(c) } Two answers: { win(a) }, { win(b) } No answer

One answer: { win(b) }

(ASP) Concept. Answer Set semantics is based on ___. Select the best answer. Stable model Unstable model Monotonic model First-Order model NP-hard model

Stable model

Consider the following program P, what is its answer set? p ← not q. q ← not p. One answer: { p } One answer: { q } Two answers: { p }, { q } No answer One answer: { }

Two answers: { p }, { q }

Consider the following program P, what is its answer set? P = { win(X) :- move(X,Y), not win(Y). move(a,b). move(b,a). } One answer: { } One answer: { win(a) } One answer: { win(b) } One answer: { win(a), win(b) } Two answers: { win(a) }, { win(b) } No answer

Two answers: { win(a) }, { win(b) }

Answer Set program to compute its solution(s) must ___. be grounded. be run as in First Order Logic be pruned be lifted be modelled

be grounded.

[ASP] concept. Answer Set Programming is ___. bottom-up reasoning top-down reasoning goal-driven reasoning monotonic reasoning non-default reasoning

bottom-up reasoning

This is an example of ___ rule of Answer Set Programming. pass(course) :- 2 {pass(test1), pass(test2), pass(test3)} 3. fact normal rule cardinality rule weight rule choice rule constraint rule

cardinality rule

This is an example of ___ rule of Answer Set Programming. {buy(pizza), buy(soda), buy(fruit)} :- at(grocery). fact normal rule cardinality rule weight rule choice rule constraint rule

choice rule

This is an example of ___ rule of Answer Set Programming. :- fail(test). fact normal rule cardinality rule weight rule choice rule constraint rule

constraint rule

This is an example of ___ rule of Answer Set Programming. const n=10. box(1..n). fact normal rule cardinality rule weight rule choice rule constraint rule

fact

[ASP] syntax Consider ASP syntax for a rule r, as shown below. b1 or . . . or bm ← a1, . . . , an, not an+1, . . . , not an+k Which one of the following selections is NOT correct? The syntax for a rule r is for a normal program. n should be greater than 0. If n=k=0 then r is a fact If k=0, then r is a positive rule If m=0, then r is a constraint to be pruned out from answer.

n should be greater than 0.

Consider the following program P: p :- not p, s, t. s. t. no answer set 1 answer set: { } 1 answer set: { p. } 1 answer set: { not p. } 1 answer set: { s, t }

no answer set

[ASP] syntax This is an example of ___ rule of Answer Set Programming. in(X,Y) :- number(X), box(Y), not not_in(X,Y). fact normal rule cardinality rule weight rule choice rule constraint rule

normal rule

Answer Set Programming is ___. Select the incorrect answer. declarative logic programming language using bottom-up in problem solving strategy one of functional programming languages suitable for nonmonotonic programming

one of functional programming languages

[ASP] syntax This is an example of ___ rule of Answer Set Programming. 10 {course(db)=6, course(ai)=6, course(xml)=3} 20 fact normal rule cardinality rule weight rule choice rule constraint rule

weight rule

[ASP] simple program. Consider the following program P (with one fact p), what is its answer set? p. { p } { not p } { } no answer set

{ p }

[ASP] Reduct. Consider the following set X of atoms and a program P, what is its reduct? X = { q } P = { p ← not q. q ← not p.} { } { p. } { p ← not q. } { q. } { not q. }

{ q. }

Consider the following set X of atoms and a program P, what is its reduct? X = { q } P = { p ← not q. } { } { p. } { p ← not q. } { q. } { not q. }

{ }

[ASP] simple program. Consider the following program P, what is its answer set? p ← p. { p } { p ← p. } { p } and { not p } { }

{ }