Proyectos freelance Informática – Semana 24/02/2014
6 small problems using Prolog. Example: "Show a Prolog predicate “indices” that takes a list of indices (numbering from zero) and a list of elements, and returns a list of the elements with the indices, so that indices( [1,3,4], [a,b,c,d,e,f], ES ) ES = [b,d,e]" total $120 Deadline in 12 hours.
6 small problems using Prolog. Example: "Show a Prolog predicate “indices” that takes a list of indices (numbering from zero) and a list of elements, and returns a list of the elements with the indices, so that indices( [1,3,4], [a,b,c,d,e,f], ES ) ES = [b,d,e]" $15 for each above type of question. total $90 Deadline in 24 hours.
6 small Leetcode type of problems using Prolog. Example: "Show a Prolog predicate “indices” that takes a list of indices (numbering from zero) and a list of elements, and returns a list of the elements with the indices, so that indices( [1,3,4], [a,b,c,d,e,f], ES ) ES = [b,d,e]" $10 for each above type of question. total $60 Deadline in 24 hours.
These are skills needed for this following project. semantics (investigating meaning of programs on different structures, e.g., selection, iterative, and recursive programs); mathematical inductions; tools for pattern matching (e.g., regular expression, DFSA, NFSA).
I need an animator for my dark fantasy book. I would like to have my prolog turned into an animation for marketing. It does not need to be the whole prolog but something that would help sell my book. Title of book series "The Chronicles of the Archangels book 1 Betrayal. It is a book series of Good vs. Evil, Light vs. Darkness, Sword and Sorcery. The book starts with this - Good has a home; it has Love that it has become one with and cherishes; it seeks to do no harm and only to lift up. Evil has no home; it only dwells, it has Hate as its adulterer; it slithers from place to place, and seeks to maliciously slaughter and to tear asunder. Stories begin at home, for those that are good. The back blurb is this - An Evil Sorcery has awakened. Bloodshed flows. Demons an...
The project is simple. Please check the file I uploaded. Feel free to contact me if you can handle the project. Due date is 11.27.
Requirements Implement all the procedures specified in using swipl Prolog. You may define auxiliary procedures as needed. An example LOG file gives examples of the use of these procedures as do the tests provided in prj3-sol.pro. You are not allowed to use any non-logical features of Prolog other than is/2. Non-logical features include the explicit cut !, implicit cut within ->, assert, retract, record, etc.
I am in need of completing a path finding (astar) algorithm in SWI Prolog. The algorithm is pretty simple, you just choose the next edge based on the next shortest path (factoring in a straight line distance heuristic to the edge where this function/rule is provided), but the recursive nature of prolog and creating rules makes it more of a challenge. There is psuedo code, notes, and a prolog graph configuration prolog file. There are also several stubs for the entry point, notes on the start state configuration structure and several slides. The assignment is just to implement the remaining rules commented by psuedo code which is estimated at 40 lines of code left. I am thinking an experienced prolog programmer could knock this out in an hour or so.
A project should be done in CSP and ASP and then test with 30 instances and running time of them should be compared. Write a Minizinc and an ASP program capable of finding a solution to the following problem. Prepare a battery of 30 benchmark instances. Generate them randomly but prepare some easy/small instances (a couple of running time seconds), some average instances (a couple of minutes) and some hard instances (exceeding timeout). Run both the Minizinc and the ASP encoding on all the instances, possibly exploring different search strategies, with a timeout of 5 minutes for each test (``configuration'' option in Minizinc, --time-limit option in clingo, in both cases you can use linux tricks) In case of COPs, report the best value for the solution found within the timeout...
I need someone who has knowledge in Prolog programming language.
You will implement certain components of an Ultimate Tic-Tac-Toe game in Prolog . We will call the Ultimate Tic Tac Toe game “UTTT” and a regular Tic-Tac-Toe game (X and 0) “TTT”. We will identify the individual tables, as well as the positions in the individual tables, by the “positions” (in the order of scrolling from left to right and from top to bottom): NW, N, NE, W, C, E, SW, S, SE. The UTTT board (we will also call it “U-board”) consists of 9 regular TTT boards (codenamed “board”). A move by a player will be a regular move by TTT to one of the boards available for moves (about this later). In the example above, the last move was to the player 0in the position indicated by the green arrow, so the player 0moved to the ...
I need to develop a very small prolog programs that contains around 10 graph functions. All functions that need to be implemented are in the "" (see files attached, its not a valid link) files with intrusctions in comments for each ones and the data structure to tests is in " "(again, see files attached, its not a valid link) .
I had a small code that I wrote for the program I don't know if you want to use it or not. its a very small code not a big one. small(X) :- X < 50. medium(X) :- X >= 50, X =< 100. big(X) :- X > 100. % classify(+N, ?Classification) classify(N, small) :- ...guard...test N for smallness... classify(N, medium) :- ...guard...test N for mediumness... classify(N, big) :- ...guard...test N for bigness... classify(N, small) :- must_be(number,N), N < 50, !. classify(N, medium) :- must_be(number,N), N >= 50, N =< 100, !. classify(N, big) :- must_be(number,N), N > 100.