Show Bid Request
Small PROLOG program
Bid Request Id: 55034
|
|
|
|
Posted by: |
franku2 (9 ratings)
(Software buyer rating 10 )
|
|
Non-action Ratio: |
Very Good - 16.67%
|
|
Posted: |
Mar 27, 2003
9:15:27 PM EDT
|
|
Bidding Closes: |
Apr 4, 2003
9:18:21 PM EDT
|
|
Viewed (by coders): |
158 times
|
|
Deadline: |
4/6/2003
TIME EXPIRED
|
|
|
|
|
Description:
Small program in PROLOG
I must be able to run the program using swi prolog.
Need to implement a FSA in prolog.
I will send more complete specs after initial bid.
Deliverables:
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Complete ownership and distribution copyrights to all work purchased.
Platform:
SWI Prolog running on a Windows 2000 box
Must be 100% finished and received by buyer on:
Apr 6, 2003 EDT
Deadline legal notes: All times are expressed in the time zone of the site EDT (UT - 5). If the buyer omitted a time, then the deadline is 11:59:59 PM EDT on the indicated date.
Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements.
We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation.
If you notice a violation please help out the site and report it. Thanks for your help.
|
|
|
Bidding/Comments:
|
All monetary amounts on the site are in United States dollars.
Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. |
See all rejected bids (and all comments)
| Name |
Bid Amount
|
Date |
Coder Rating |
|
|
|
|
N/A
|
Mar 28, 2003
7:31:20 AM EDT
|
9.9
(Excellent)
|
|
|
hi, we are extremely good at prolog and we have done several projects as you can check our rating. could you give us more details on the project so we can bid it with the right price
bye
GAD Software |
|
|
|
|
|
|
N/A
|
Mar 28, 2003
10:17:54 AM EDT
|
9.9
(Excellent)
|
|
|
Hi we attach you a simple prolog program,please check it and please give us more information about your project.
We have written many projects on SWI Arity and Sicstus prolog. we are all with master degree in Computer Science and Informatics(ph.D. in AI now).
GAD Software |
|
|
Attached File
|
|
|
|
This bid was accepted by the buyer!
|
$20 (USD)
|
Mar 31, 2003
10:58:13 AM EDT
|
9.9
(Excellent)
|
|
|
hi, sorry for the late reply. about the warnings - actually they are not so important. it is important the program to work with or without them. so here's our bid. we have already made your project. here's the source for the first two parts of the assignment.
final(s3).
transition(s1,a,s1).
transition(s1,b,s1).
transition(s1,a,s2).
transition(s2,b,s3).
transition(s3,b,s4).
null(s2,s4).
null(s3,s1).
these are the three predicats wanted and the representation of the FSA on the graph on the specs. as you can see it is extremely simple source. the source of the accepts(Node,String) predikat is also so simple - it's just another three lines of source. we'll send it to you right after acceptance of the bid.
Note that this source is working with lists not strings, i.e. you have to write
accepts(s1, [a,a,b]).
instead of
accepts(s1, 'aab').
this is because of easiest implementation/understandance. we have also developed a version which accepts strings as in the second example and as wanted in the specs. to be able to work you will need additional predicate to convert a string to list. here it is
string_list(_, Len, Len, []).
string_list(Str, Pos, Len, [AtomName|List]):-
sub_string(Str, Pos, 1, _, Char), string_to_atom(Char, AtomName),
Pos1 is Pos + 1, string_list(Str, Pos1, Len, List).
string_list(String, List):- string_length(String, Len), string_list(String, 0, Len, List).
having it we developed the final accepts(Node,String) predicate simply
accepts(String):- string_list(String, List), accepts(s1, List).
it converts the string to a list and calls the original accepts predicate(just 3 additional rows).
we were using swi prolog 4.0.11 and it compiles without errors and warnings.
we'll send you the full version right after acceptance of our bid
thanks for the bid,
bye
GAD Software |
|
|
|
|
|
|
