Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8186069
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 7, 20262026-06-07T02:04:10+00:00 2026-06-07T02:04:10+00:00

What problem can occur when we use append with cut operator? append2([],L,L):-!. append2([H|T],L,[H|TL]):-append2(T,L,TL). I

  • 0

What problem can occur when we use append with cut operator?

   append2([],L,L):-!.
   append2([H|T],L,[H|TL]):-append2(T,L,TL).

I have tried several different inputs, but it always succeeds.

?- append2([1,2],[5],L).
L = [1, 2, 5].

?- append2([1,2],[1,2],L).
L = [1, 2, 1, 2].

?- append2([],[1,2],L).
L = [1, 2].

?- append2([1,2],[],L).
L = [1, 2].
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-07T02:04:11+00:00Added an answer on June 7, 2026 at 2:04 am

    There are two kinds of cuts; green cuts and red cuts. Green cuts are inserted just to improve efficiency and don’t change the semantics of the program. Red cuts, on the other hand, do. By definition, green cuts do not cause any problems.

    So, is there any way that the behaviour would change if the cut wasn’t there?

    Lets see; for the first clause to match, L1 should be unifiable with [], L2 with L and L3 with L or, in other words, L2 unifiable with L3.

    When L1 is [] the second clause cannot match; so the cut doesn’t have any effect

    When L1 is not instantiated:
    if the length of L2 and L3 are known at this point, then they must be equal otherwise the first clause wouldn’t match; thus, the second clause cannot match since at each step the length of L3 is decreased by 1 and the only way to terminate requires L2=L3

    if the length of L3 or L2 is not known:
    then we have a problem since the second clause may produce solutions.

    Indeed:

        3 ?- append2(L1,L2,[1,2,3]).
        L1 = [],
        L2 = [1, 2, 3].
    
        4 ?- append2(L1,[1,2,3],L3).
        L1 = [],
        L3 = [1, 2, 3].
    
        5 ?- append2(L1,L2,L3).
        L1 = [],
        L2 = L3.
    
        6 ?- append2(L1,[E1,E2],L3).
        L1 = [],
        L2 = [E1, E2].
    
        7 ?- append2(L1,L2,[E1,E2]).
        L1 = [],
        L2 = [E1, E2].
    

    while we expect:

    8 ?- append(L1,L2,[1,2,3]).
    L1 = [],
    L2 = [1, 2, 3] ;
    L1 = [1],
    L2 = [2, 3] ;
    L1 = [1, 2],
    L2 = [3] ;
    L1 = [1, 2, 3],
    L2 = [] ;
    false.
    
    9 ?- append(L1,[1,2,3],L3).
    L1 = [],
    L3 = [1, 2, 3] ;
    L1 = [_G24],
    L3 = [_G24, 1, 2, 3] ;
    L1 = [_G24, _G30],
    L3 = [_G24, _G30, 1, 2, 3] ;
    L1 = [_G24, _G30, _G36],
    L3 = [_G24, _G30, _G36, 1, 2, 3] ;
    L1 = [_G24, _G30, _G36, _G42],
    L3 = [_G24, _G30, _G36, _G42, 1, 2, 3] ;
    ...
    
    10 ?- append(L1,L2,L3).
    L1 = [],
    L2 = L3 ;
    L1 = [_G22],
    L3 = [_G22|L2] ;
    L1 = [_G22, _G28],
    L3 = [_G22, _G28|L2] ;
    ....
    
    11 ?- append(L1,[E1,E2],L3).
    L1 = [],
    L3 = [E1, E2] ;
    L1 = [_G78],
    L3 = [_G78, E1, E2] ;
    L1 = [_G78, _G84],
    L3 = [_G78, _G84, E1, E2] ;
    L1 = [_G78, _G84, _G90],
    L3 = [_G78, _G84, _G90, E1, E2] ;
    ...
    
    12 ?- append(L1,L2,[E1,E2]).
    L1 = [],
    L2 = [E1, E2] ;
    L1 = [E1],
    L2 = [E2] ;
    L1 = [E1, E2],
    L2 = [] ;
    false.
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a problem and can't find a solution. I am making an accordion
I have a problem and can't solve it alone. My teacher gives me one
I have a problem - i can't compile SqlCipher. I'm using this http://groups.google.com/group/sqlcipher/browse_thread/thread/55c6296b56bf4533/c792bbec6df7d4f4?tvc=2#c792bbec6df7d4f4 instructions
Problem: I need to be able identify when two whitespaces occur consecutively. I have
My problem can be reduced to basically the following set of entities : I
My problem can be summed up by making this simple command works : nice
I am facing a problem - can not update the price of the variant
I think that this problem can be sorted using reflection (a technology which I'm
Seems like the slow Tomcat 7 startup problem can be resolved with metadata-complete set
No foreign keys defined in the database. So I've setup associations. problem: can't seem

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.