What should I do to the code in order to be able to do these operations? Provide

ID: 3866440 • Letter: W

Question

What should I do to the code in order to be able to do these operations?

Provide Code is As Follows:

% egin{verbatim}

const length=7.

time(1..length).

block(a).
block(b).
block(c).

initially(handempty).
initially(clear(a)).
initially(clear(c)).
initially(ontable(c)).
initially(ontable(b)).
initially(on(a,b)).

finally(on(a,c)).
finally(on(c,b)).
finally(ontable(b)).

not_goal(T):- time(T),
    literal(X),
    finally(X),
    not holds(X,T).

goal(T) :- time(T),
    not not_goal(T).

exists_plan :- goal(length).

:- not exists_plan.

%Defining what are fluents and
%what are actions.

fluent(on(X,Y)) :-
    block(X),
    block(Y).

fluent(ontable(X)) :-
    block(X).

fluent(clear(X)) :-
    block(X).

fluent(holding(X)) :-
    block(X).

fluent(handempty).

action(pick_up(X)) :-
    block(X).

action(put_down(X)) :-
    block(X).

action(stack(X,Y)) :-
    block(X),
    block(Y).

action(unstack(X,Y)) :-
    block(X),
    block(Y).

%Effects of actions and executability conditions.
executable(pick_up(X), T)   :-
    block(X),
    time(T),
    T < length,
    holds(clear(X), T),
    holds(ontable(X), T),
    holds(handempty, T).

executable(put_down(X), T) :-
    block(X),
        time(T),
        T < length,
    holds(holding(X),T).

executable(stack(X,Y),T)    :-
    block(Y),
    block(X),
        time(T),
        T < length,
    holds(holding(X),T),
    holds(clear(Y), T).

executable(unstack(X,Y),T) :-
    block(Y),
    block(X),
        time(T),
        T < length,
        holds(clear(X), T),
        holds(on(X,Y), T),
        holds(handempty, T).

causes(pick_up(X), neg(ontable(X))) :-
    block(X).

causes(pick_up(X), neg(clear(X)))   :-
    block(X).

causes(pick_up(X), holding(X))      :-
    block(X).

causes(pick_up(X), neg(handempty))      :-
        block(X).

causes(put_down(X), ontable(X))     :-
        block(X).

causes(put_down(X), clear(X))           :-
        block(X).

causes(put_down(X), neg(holding(X)))    :-
        block(X).

causes(put_down(X), handempty)          :-
        block(X).

causes(stack(X,Y), neg(holding(X))) :-
    block(X),
    block(Y).

causes(stack(X,Y), neg(clear(Y)))       :-
        block(X),
        block(Y).

causes(stack(X,Y), clear(X))            :-
        block(X),
        block(Y).

causes(stack(X,Y), handempty)           :-
        block(X),
        block(Y).

causes(stack(X,Y), on(X,Y))             :-
        block(X),
        block(Y).

causes(unstack(X,Y), holding(X))        :-
        block(X),
        block(Y).

causes(unstack(X,Y), clear(Y))          :-
        block(X),
        block(Y).

causes(unstack(X,Y), neg(clear(X)))     :-
        block(X),
        block(Y).

causes(unstack(X,Y), neg(handempty))      :-
        block(X),
        block(Y).

causes(unstack(X,Y), neg(on(X,Y)))        :-
        block(X),
        block(Y).

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

literal(G) :-
    fluent(G).

literal(neg(G)) :-
    fluent(G).

contrary(F, neg(F)) :-
    fluent(F).

contrary(neg(F), F) :-
    fluent(F).

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

holds(F, 1) :-
    literal(F),
    initially(F).

holds(F, T+1)   :-
    literal(F),
    time(T),
    T < length,
    action(A),
    executable(A,T),
    occurs(A,T),
    causes(A,F).

holds(F, T+1)   :-
        literal(F),
    literal(G),
    contrary(F,G),
        time(T),
        T < length,
    holds(F,T),
    not holds(G, T+1).

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

possible(A,T)   :-
    action(A),
    time(T),
    executable(A,T),
    not goal(T).

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

occurs(A,T) :-
    action(A),
    time(T),
    possible(A,T),
    not not_occurs(A,T).

not_occurs(A,T) :-
    action(A),
    action(AA),
    time(T),
    occurs(AA,T),
    neq(A,AA).

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
show initially(X).
show finally(X).
hide time(T).
hide action(A).
hide causes(A,F).
hide initially(F).
hide contrary(F,G).
hide fluent(F).
hide literal(L).
hide executable(A,T).
hide holds(F,T).
hide not_occurs(A,T).
hide possible(A,T).
hide possible1(A,T).
hide possible2(A,T).
hide block(X).
hide exists_plan.
hide finally(X).
% hide goal(T).
hide not_goal(T).

% end{verbatim}

Task3. Blocks World with Answer Set Programming We have a different shaped block (e.g., triangular block which one cannot place or stack other block on it) Add this constraint to your program, and modify it to achieve the following goal from the initial situation to the goal situation. (1) Find the first answer and copy your ASP answer here. List only initially, finally, and occurs for your solution (hide and show options). 2) Submit separately a zip file (all the program codes including this ASP program).

Explanation / Answer

i think the code is correct

Navigate

What should I do next?! You are to conduct an extensive sensitivity analysis on

What should I recommend as a nurse for the diagnosis of this patient? Case study

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

What should I do to the code in order to be able to do these operations? Provide

Question

Explanation / Answer

Related Questions

Navigate