AI::Prolog::Builtins 0.739

AI::Prolog::Builtins is a Perl module with builtin predicates that AI::Prolog supports. Comments Comments begin with a % and terminate at the end of the line or begin with /* and terminate with */. Variables As in Prolog, all variables begin with an upper-case letter and are not quoted. In the following example, STUFF is a variable. steals(badguy, STUFF, "Some rich person"). Constants Constants begin with lower-case letters. If you need a constant that begins with an upper-case letter or contains spaces or other non-alphanumeric characters, enclose the constant in single or double quotes The quotes will not be included in the constant. In the following example, badguy and Some rich person are both constants: steals(badguy, STUFF, "Some rich person"). Miscellaneous This will not work: p(X) :- X. /* does not work */ Use this instead: p(X) :- call(X). BUILTINS !/0 The "cut" operator. This is used when you wish to tell Prolog that you only need to satisfy a goal once. For example, if you wish to deny someone the right to rent videos if they have overdue videos, you might use the cut operator as soon as you see they have any overdue video. The fact that they have more than one overdue video doesnt matter. See the cut.pl program in the examples/ directory that comes with this distribution. assert/1 Add new facts to the database. Only facts can be added, not rules. This may change in the future. See retract(X). assert(loves(ovid,perl)). call/1 Invokes X as a goal. consult/1 Supplied the name of a file containing Prolog code, this will consult the Prolog code in the file and add its contents to the current knowledgebase. Will warn if the file cannot be opened. div/2 Succeeds if both terms are bound. The value of the term is X / Y. Use with is(X,Y). is(X, div(N,3)). This is the internal form of the infix operator: N / 3. eq/2 Succeeds if X and Y are equal. This is the internal form of the infix operator: X == Y. fail/0 This goal always fails. Useful when youve reached a condition you know should not succeed. kill(Hero, Beast) :- not(has_weapon(Hero)), fail. ge/2 Succeeds if both terms are bound and X >= Y. This is the internal form of the infix operator: X >= Y. gt/2 Succeeds if both terms are bound and X > Y. This is the internal form of the infix operator: X > Y. halt/1 In the aiprolog shell, exist shell. Currently has no other effect. if/3 If X succeeds as a goal, try Y as a goal. Otherwise, try Z. thief(badguy). steals(PERP, X) :- if(thief(PERP), eq(X,rubies), eq(X,nothing)). is/2 If X is unbound and Y is bound to a number, the goal succeeds and X becomes bound to the value of Y. Otherwise, succeeds if both terms are bound, numbers, and equal. All other conditions result in failure. This is the internal form of the infix operator: X is Y. le/2 Succeeds if both terms are bound and X <= Y. This is the internal form of the infix operator: X <= Y. listing/0 Dumps a listing of all user-defined predicates and how they are defined. listing/1 Dumps a listing of the requested predicate. X must a variable or string instantiated in functor/arity) form. Note that, unlike most Prologs, this means that the followig will not work: listing(foo/2). Use this instead: listing(foo/2). lt/2 Succeeds if both terms are bound and X < Y. This is the internal form of the infix operator: X < Y. minus/2 Succeeds if both terms are bound. The value of the term is X - Y. Use with is(X,Y). is(X, minus(N,1)). This is the internal form of the infix operator: N - 1. mod/2 Succeeds if both terms are bound. The value of the term is X % Y. (modulus) Use with is(X,Y). is(X, mod(N,3)). This is the internal form of the infix operator: N % 3. mult/2 Succeeds if both terms are bound. The value of the term is X * Y. Use with is(X,Y). is(X, mult(N,3)). This is the internal form of the infix operator: N * 3. ne/2 Succeeds if X and Y cannot be proven to be equal. This is the internal form of the infix operator: X = Y. nl/0 Prints a newline. not/1 Succeeds if X cannot be proven. This is not negation as were used to seeing it in procedural languages. notrace/0 Turns off tracing of Prologs attempt to satisfy goals. once/1 Stop solving for X if X succeeds. Defined as: once(X) :- X, !; or/2 Succeeds as a goal if either X or Y succeeds. plus/2 Succeeds if both terms are bound. The value of the term is X + Y. Use with is(X,Y). is(X, plus(N,1)). print/1 Prints the current Term. If the term is an unbound variable, it will print the an underscore followed by the internal variable number (e.g., "_284"). print(ovid). % prints "ovid" print("Something"). % prints "Something" print(Something). % prints whatever variable Something is bound to println/1 Same as print(Term), but automatically prints a newline at the end. pow/2 Succeeds if both terms are bound. The value of the term is X ** Y (X raised to the Y power). Use with is(X,Y). retract/1 Remove facts from the database. You cannot remove rules. This may change in the future. See assert(X). retract(loves(ovid,java)). trace/0 Turns on tracing of Prologs attempt to satisfy goals. true/0 True goal. Automatically succeeds. var/1 Succeeds if X is an unbound variable. Otherwise, this goal fails. write/1 Prints the current Term. If the term is an unbound variable, it will print the an underscore followed by the internal variable number (e.g., "_284"). write(ovid). % prints "ovid" write("Something"). % prints "Something" write(Something). % prints whatever variable Something is bound to writeln/1 Same as write(Term), but automatically prints a newline at the end..

Requirements:	No special requirements
Platforms:	Linux
Keyword:	Ai,  Aiprologbuiltins,  Bound,  Goal,  Libraries,  Perl Module,  Programming,  Stuff,  Succeeds,  Terms
Users rating:	0/10