ASP and Prolog Need this ASAP

Part 2 (50%): Logic Programming and Comparison

Create a logic program or logic programs that solve the problems in the domain considered in part

1. It should work for any given make-span value (the number of available time-steps). To achieve

this, you may use either Prolog or Answer Set Programming (ASP). When using Prolog, the

solution should employ a search algorithm (possibly heuristic) that has been introduced in class.

When using ASP, one can start from a program obtained by transforming a PDDL domain of part 1

into ASP rules, as seen in class.

For this part, you need to produce the Prolog or ASP files for both the domain and the problems. To

do this, you can use a text editor or an approriate IDE (e.g., ASPIDE if you choose to use ASP).

Moreover, you need to test them and state what Prolog or ASP system you have used, and how it is

to be invoked to produce a plan.

Hand in:

(a) an electronic version of: (i) the domain model (ii) the problem files;

(b) documentation (PDF file) about your files as follows: (i) a description of how you produced

them, and what tools, if any, you used (e.g. a text editor, ASPIDE); (ii) a short description of the

meaning of each rule in it; a short essay (800 - 1000 words) comparing this solution to the one of

part 1. Comment on both modelling and performance aspects.

ASP Μηχανολογία Prolog Research Writing

Ταυτότητα Εργασίας: #7109410

Σχετικά με την εργασία