Good morning!

I have a file that I want to put into a map line by line. I know how to put it char by char, but how can I put it line by line as far as there is no symbol for it? (or maybe "\n" but it's not visible).

here is my file:

loves(vincent, mia). loves(marcellus, mia). loves(pumpkin, honey_bunny). loves(honey_bunny, pumpkin). jealous(X, Y) :- loves(X, Z), loves(Y, Z).

and here is my map


InputStream ips= new FileInputStream(file); while ((content = ips.read()) != -1) { //I want to convert it to char and put it in an map line by line map.put(i, (char) content); if(){} i++; }

Thank you in advance for your help!

Use a BufferedReader, which you can get from Files.newBufferedReader(). This gives you access to the readLine method.

Don't use the read() methods, unless you need to be convinced how bad they are.

I worked with a simple array but used a bufferReader, I think its use is quite similar for a map.
Thank you for the idea!

InputStream ips= new FileInputStream(fichier); InputStreamReader ipsr= new InputStreamReader(ips); BufferedReader br= new BufferedReader(ipsr); String ligne; while((ligne=br.readLine())!= null){ System.out.println(ligne+" "+ligne.charAt(ligne.length()-1)); Clauses[i]=ligne; //System.out.println(Clauses[i]); i++; } br.close();

In Java 8 you can also use Files.lines method.

I think I have an issue however, when reading the file and giving each lines to Clauses.
Indeed having used a buffer, I do Clause = readLine(); (yet, I think it's unable to change lines by itself.)

with the following file projet.pl

loves(vincent, mia). loves(marcellus, mia). loves(pumpkin, honey_bunny). loves(honey_bunny, pumpkin). jealous(X, Y) :- loves(X, Z), loves(Y, Z).

And the following code

class Prolog{ static int content; static int j=0; static int i=0; static String Clauses[]; static String VarAffich []; static Object VarVal[]; static int VarSubst[]; static int maxVar; static String fichier= "projet.pl";// the prolog file we are reading: a true love story. public static void main(String[] args) { String chaine=""; Clauses = new String[12]; VarAffich = new String[maxVar]; VarVal = new Object[maxVar]; VarSubst = new int [maxVar];//reading text file try{ InputStream ips= new FileInputStream(fichier); InputStreamReader ipsr= new InputStreamReader(ips); BufferedReader br= new BufferedReader(ipsr); String ligne; while((ligne=br.readLine())!= null){ System.out.println(ligne+" "+ligne.charAt(ligne.length()-1)); Clauses[i]=br.readLine(); //System.out.println(Clauses[i]); System.out.println(Clauses+" "+ligne.charAt(ligne.length()-1)); i++; } br.close(); } catch(Exception e){ System.out.println(e.toString()); }

And on the terminal I have:

loves(vincent, mia). . [Ljava.lang.String;@5fbd8c6e . loves(pumpkin, honey_bunny). . [Ljava.lang.String;@5fbd8c6e . java.lang.StringIndexOutOfBoundsException: String index out of range: -1 0 - null

So I think I don't use quite well the readLine command...

Use printStackTrace() when printing out exception details.
That will give you the stack trace as well as the error message, so you know exactly where in your code the exception occurred.

You call readLine() twice, by the way, which may be the cause of your problem.
Shouldn't the assignment to Clauses[i] use the already read in line (ligne) and not the next line?

Also, the reason you get that "odd" output is because Clauses is an array of Strings, so you probably need to use something like Arrays.toString() to get a String representation of it.

Don't use input streams for reading text files. Have a look at the Java™ Tutorials, where you find that a text file is best read with a file reader (or a Scanner). Use try‑with‑resources to close your readers rather than en explicit close() call.

Antoine Compagnie wrote:. . . // ... while((ligne=br.readLine())!= null){ System.out.println(ligne+" "+ligne.charAt(ligne.length()-1)); Clauses[i]=br.readLine(); // .... . .

I shall leave you to work out why you are only using every other line.

I merged your stuff with the following thread. I hope that is okay by you.

Good evening,

I recently learnt how to read line by line a file in char. Yet, I have some issues to add the String lines I read to a String array named clauses
Indeed, with the following code:

Clauses = new String[12]; VarAffich = new String[maxVar]; VarVal = new Object[maxVar]; VarSubst = new int [maxVar];//reading text file try{ InputStream ips= new FileInputStream(fichier); InputStreamReader ipsr= new InputStreamReader(ips); BufferedReader br= new BufferedReader(ipsr); String ligne; while((ligne=br.readLine())!= null){ System.out.println(ligne+" "+ligne.charAt(ligne.length()-1)); Clauses[i]=ligne; //System.out.println(Clauses[i]); System.out.println(Clauses); i++; } br.close();

I get the following output

loves(vincent, mia). . [Ljava.lang.String;@5fbd8c6e loves(marcellus, mia). . [Ljava.lang.String;@5fbd8c6e loves(pumpkin, honey_bunny). . [Ljava.lang.String;@5fbd8c6e loves(honey_bunny, pumpkin). . [Ljava.lang.String;@5fbd8c6e java.lang.StringIndexOutOfBoundsException: String index out of range: -1 0 - null

The line in between are not the one expected.

Can you help me understand and fiw this issue? Even give me some advises if you think this is a dumb mistake?
It looks like I have the adresses but I'm not sure as far as they are all alike...

See my reply in our other thread:
https://coderanch.com/t/661900/java/java/Inserting-map-line-line

Dave Tolls, I did what you advised me to do and it worked, thank you!

try{ InputStream ips= new FileInputStream(fichier); InputStreamReader ipsr= new InputStreamReader(ips); BufferedReader br= new BufferedReader(ipsr); String ligne; while((ligne=br.readLine())!= null){ //System.out.println(ligne+" "+ligne.charAt(ligne.length()-1)); Clauses[i]=ligne; i++; } br.close(); System.out.println(Arrays.toString(Clauses)); } catch(Exception e){ System.out.println(e.toString()); e.printStackTrace(); }

I know have

[loves(vincent, mia)., loves(marcellus, mia)., loves(pumpkin, honey_bunny)., loves(honey_bunny, pumpkin)., , jealous(X, Y) :-, loves(X, Z),, loves(Y, Z)., null, null, null, null]

But I don't understand why there are 4 nulls...

Campbell Ritchie, do you mean I should replace

try{ InputStream ips= new FileInputStream(fichier); InputStreamReader ipsr= new InputStreamReader(ips); BufferedReader br= new BufferedReader(ipsr); String ligne;

by

try{ BufferedReader br= new BufferedReader(fichier); String ligne;

No. That code will not work and will probably not even compile because there isn't a buffered reader constructor taking a file. You should also use try with resources as I said yesterday. Did you read the tutorials link I gave you? It has a page telling you how to set up a buffered reader.

As for nulls: what is the size of your array and what is the size of your input file? If they are different you will either exceed the capacity of the array, causing an exception, or you will have unoccupied spaces at the end of the array, which will appear as nulls. You should consider using a List<String> rather than an array to cure that problem.

Antoine Compagnie wrote:Campbell Ritchie, do you mean I should replace...

I've gone over this thread, and I have to admit; I'm completely mystified as to what's going on.

You plainly want to read lines from a file an add them to a Map, but all that describes to us is "mechanics".
Why do you want to do this? And why a Map? Why not a List, or a Stack, or a Deque?

My advice: Forget about Java for a moment, and explain to us, in English, what this program is supposed to do. Is it a game? Or some sort of algorithm?

If we knew that, we could probably advise you more; but right now all we can do is help you out with each grammatical problem you run into - and that's a very laborious (and inferior) way to write a program.

HIH

Winston

Okay, your right, I didn't wanted to bother anybody with long explanations about what I was working on and solely asked for technical responses.
But here is what I'm working on:

I am actually creating a prolog terminal, Prolog is based on the resolution of first order predicate. It is based on the resolution principle.

My terminal has to manipulate arithmetic as well as fail cut, write() and read(), it has been advised to use the SWI prolog syntax

For instance:
p(a,b). p(b,b).p(b,15). q(X,Y,Z): -p(X,Y),p(Y,Z),write(X),write(Y),write(Z),nl,fail. Goal q(U,V,W)
gives:
abb / ab15 / bbb / bb15

A prolog file has to be read by my program and printed out with a graphical interface.

Arithmetical predicates has to be taken into account

Take into account the clauses that have several lines

Tests with the example above

We will use a class Clause deriving from LinkedList with the inner class Litteral (attributs predicats, listVar) deriving equally from LinkedList with the inner class Symbole.
Thus, a clause would correspond of an instanciation of the Clause classwhich content would be instances of the class Litteral which content would be instances of the class Symbole
This last one would represents either variables or alphanumerical constants.
A symbole would be displayed by its code. It gives access to two information of type Map within the class Annuaire:

displaying the symbol

and its value

If two clauses has the variables X, there wil be nonetheless two symbol in the inner displaying.

The clause
p(X,2,"abc"),nl.
will be dsiplayed by a set of instaciations:



I only coded the main, all the rest was from my teacher.
In order to do that I have to

put the symbols (and only them) in a HashMap

Verify that p(X,Y,Z) work with p(U,V,W)

know if we are dealing with variables or constants

know if it is a case of var/var, const/var, const/ const

deal with these cases

Here is the whole code from my teacher. I now have to put the symobols into an HashMap, which was the original topic.

package projetJava; // We have to place a projet.pl file in our workplace import java.awt.Container; import java.awt.GridLayout; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import java.io.*; import java.util.*; import javax.swing.*; class Prolog{ static int content; static int j=0; static int i=0; static String Clauses[]; static String VarAffich []; static Object VarVal[]; static int VarSubst[]; static int maxVar; static String fichier= "projet.pl";// created but empty and inexistent thus creating issues.// How to actually import it? public static void main(String[] args) { String chaine=""; Clauses = new String[12]; VarAffich = new String[maxVar]; VarVal = new Object[maxVar]; VarSubst = new int [maxVar];//reading text file try{ InputStream ips= new FileInputStream(fichier); InputStreamReader ipsr= new InputStreamReader(ips); BufferedReader br= new BufferedReader(ipsr); String ligne; while((ligne=br.readLine())!= null){ //System.out.println(ligne+" "+ligne.charAt(ligne.length()-1)); Clauses[i]=ligne; //System.out.println(Clauses[i]); i++; } br.close(); System.out.println(Arrays.toString(Clauses)); } catch(Exception e){ System.out.println(e.toString()); e.printStackTrace(); } //We have to create a method that place every symbol of Clauses in a map for (int i = 0; i < Clauses.length; i++) { Annuaire.ValSymbole.put(j,Clauses[i]); } System.out.println(Annuaire.ValSymbole); /* while ((content = Clauses.read()) != -1) { //I want to convert it to char and put it in a map symbol by symbol Annuaire.ValSymbole.put(j, (char) content); j++; }*/ /*for(Object key: Annuaire.ValSymbole.keySet()) System.out.println(key + " - " + Annuaire.ValSymbole.get(key)); System.out.println();*/ Clause c = new Clause(); for (String elem :Clauses) c.liste.add (elem); } static Clause ri(int noClause){ Clause c = new Clause(); String mot = ""; String mot_old = ""; List liste = new LinkedList(); Clause.Litteral ll = null; Clause.Litteral.Symbole s = null; boolean variables = false; boolean predicat = false; do{ mot_old = mot; mot = parsingClause(noClause); //System.out.println("analyse de: "+mot); if(mot.equals("(")){ variables = true; ll = c.new Litteral(mot_old); c.add(ll); continue; } if(mot.equals(",")){ if(variables){ ll.add(ll.new Symbole(mot_old)); } if(predicat){ predicat = false; c.add( c.new Litteral(mot_old)); } continue; } if(mot.equals(")")){ variables = false; ll.add(ll.new Symbole(mot_old)); continue; } else{// c'est un mot if(predicatConstant(mot)){predicat = true;} continue; } }while (!mot.equals("")); // cas d'un predicat constant en fin de clause: if(predicat){c.add(c.new Litteral(mot_old));} return c; } static boolean delimiteur(char c){ boolean b = false; if(c=='('||c==')'||c==','||c==':')b = true; return b; } static boolean predicatConstant(String p){ boolean b = false; if(p.equals("nl")||p.equals("fail")||p.equals("!")||p.equals("cut")) b = true; return b; } static String parsingClause(int noClause){ String mot=""; while(Clauses[noClause].charAt(0)==' '){ Clauses[noClause]=Clauses[noClause].substring(1); } if(Clauses[noClause].charAt(0)=='.'){ Clauses[noClause]=Clauses[noClause].substring(1);return mot; } if(Clauses[noClause].charAt(0)==':' && Clauses[noClause].charAt(1)=='-'){ Clauses[noClause]=Clauses[noClause].substring(2);return ":-"; } if(delimiteur(Clauses[noClause].charAt(0))){ String r= Character.toString(Clauses[noClause].charAt(0)); Clauses[noClause]=Clauses[noClause].substring(1);return r; } // begining of the word parsing while(!delimiteur(Clauses[noClause].charAt(0))&& Clauses[noClause].charAt(0)!='.'&&Clauses[noClause].charAt(0)!=' ') { mot+=Character.toString(Clauses[noClause].charAt(0)); Clauses[noClause]=Clauses[noClause].substring(1); } return mot; } } class Annuaire{ static Map<Integer,Object> ValSymbole = new HashMap<Integer,Object>();// symbol displaying static Map<Integer,String> AffSymbole = new HashMap<Integer,String>();// symbol value static String aff(int c){return AffSymbole.get(c);}// Yet, that's what the techer gave... static Object val(int c){return ValSymbole.get(c);} static int Code=1; } class Clause extends LinkedList{ static List ListeClauses = new LinkedList(); List listeVar; //Shouldn'it be static? List listeCode; //Shouldn'it be static? List listeLitteraux; //Shouldn'it be static? int varExiste(String n){ for(int i=0;i<listeVar.size();i++){ if( ((String)listeVar.get(i)).equals(n)) return i; } return -1; } Clause(){ super(); listeVar = new LinkedList(); listeCode = new LinkedList(); System.out.println("creation clause"); listeLitteraux = new LinkedList();ListeClauses.add(this); } public String toString(){/* TO BE MODIFIED*/ return ""; } class Litteral extends LinkedList{ String predicat; List listeVar; Litteral(String p){ super(); predicat = p;listeVar = new LinkedList();listeLitteraux.add(this); //System.out.println("creation litteral "+predicat); } public String toString(){ return ""; } class Symbole{ int code; Symbole(String s){ if(varExiste(s)<0){ // nouvelle variable code=Annuaire.Code++; // son code Annuaire.AffSymbole.put(code, s);// Annuaire.ValSymbole.put(code, null);// Clause.this.listeVar.add(s); Clause.this.listeCode.add(code); } else{ // la variable existe code=(Integer)listeCode.get(varExiste(s)); //code de la var qui existe } } public String toString(){return Annuaire.aff(code);} }// fin Symbole }// fin Litteral }// fin Claus //}// WHY THE HELL DO I NEED SUCH A THING??? /*class Manager { static JFrame Affichage; Manager(){
 ManagerGUI mGUI = new ManagerGUI();//Pourquoi veut il des variables?// qu'est ce qu'un manager GUI? mGUI.setVisible(true); } } class ManagerGUI implements ActionListener{ ManagerGUI(int n){ //init(); JButton bInit = new JButton("Init"); JButton bPaP = new JButton("Pas à Pas"); JButton bResol = new JButton("Resolution"); GridLayout d = new GridLayout(n+1,n); JFrame fenetre = new JFrame("Projet Prolog L3"); JPanel affichage = new JPanel(); JPanel commande = new JPanel(); Container c = fenetre.getContentPane(); //c.setLayout(d);
 commande.add(bPaP); commande.add(bInit); commande.add(bResol);// I changed it to bResol c.add(commande); bInit.addActionListener(this); bPaP.addActionListener(this); affichage.setLayout(d); //c.add(affichage);
 Manager.Affichage = fenetre; } public void setVisible(boolean b) { // TODO Auto-generated method stub } public void actionPerformed(ActionEvent e){ String s = e.getActionCommand(); if (s.equals("Init")){ System.out.println("Init"); } } }*/

Antoine Compagnie wrote:But here is what I'm working on:...

OK, thanks for that. Now WE have something to work on.

It's going to take me a while to go through this (and learn a bit about Prolog), but one thing I can say immediately is that your main() method is FAR too big.

My advice: Since you're currently dealing with Prolog input - and you're absolutely right to forget about the UI until this is done - create a class called PrologInput (or PrologParser), and transfer ALL the logic that you're currently writing in main() to that.

This class should take an InputStream and return "prolog-ready" components, such as (I suspect) Clauses and their associated symbol table. You might even want to think about a structure that represents an entire Prolog program.

Take into account the clauses that have several lines.

So it sounds to me like (as in Java) a "line" and a "statement" aren't the same thing. So I suspect that this is one of the first things you'll want to do:
1. Read in lines.
2. Convert lines to statements (a "statement" being a String that has a 1:1 relationship with a Clause).

The only thing I would add is that your class should also be able to recognise invalid clauses.

I'll get back as soon as I've digested your post and have more advice.

HIH

Winston

Okay, thanks for your advises. My main is too long, I developed it myself and it is much more a laboratory than an actual thing, even if the few things to br.close seems to be a good start.

I do want to read in lines and convert these lines into statements and a Statement is indeed a String that has a 1:1 relationship with a Clause.
You're right, as in Java, in Prolog a line isn't a statement.
My point is now to put the symbols (and only them) in HashMaps Annuaire.aff and Annuaire.val to be able to compare two clauses and apply the resolution principle (Horn clause)
Thank you for your help and advises. I will try to give as much detail as I could.

Good morning,

since last time, I did some work:
I achieved to put the symbols in a hasmap. Actually, thanks to the parsing ri they came as litterals:

I did:

InputStream ips= new FileInputStream(fichier); InputStreamReader ipsr= new InputStreamReader(ips); BufferedReader br= new BufferedReader(ipsr); String ligne; while((ligne=br.readLine())!= null){ Clauses[i]=ligne; System.out.println(ri(i)); i++; }

And thanks to the toString of Litterals:

class Litteral extends LinkedList{ String predicat; List listeVar; Litteral(String p){ super(); predicat = p;listeVar = new LinkedList();listeLitteraux.add(this); //System.out.println("creation litteral "+predicat); } public String toString(){ return predicat + super.toString(); }

The following came:


creation clause [loves[vincent, mia]] creation clause [loves[marcellus, mia]] creation clause [loves[pumpkin, honey_bunny]] creation clause [loves[honey_bunny, pumpkin]] creation clause [loves[X, mia]] creation clause [loves[vincent, Y]] creation clause [jealous[X, Y], loves[X, Z], loves[Y, Z]] creation clause [jealous[U, V]]

My clause are displayed by:

System.out.println(Clause.ListeClauses);
Which gives the following:

[[loves[vincent, mia]], [loves[marcellus, mia]], [loves[pumpkin, honey_bunny]], [loves[honey_bunny, pumpkin]], [loves[X, mia]], [loves[vincent, Y]], [jealous[X, Y], loves[X, Z], loves[Y, Z]], [jealous[U, V]]]

And the hashmaps:

System.out.println(Annuaire.ValSymbole);// why is it empty? System.out.println(Annuaire.AffSymbole);

Which gives:

{1=null, 2=null, 3=null, 4=null, 5=null, 6=null, 7=null, 8=null, 9=null, 10=null, 11=null, 12=null, 13=null, 14=null, 15=null, 17=null, 16=null}
{1=vincent, 2=mia, 3=marcellus, 4=mia, 5=pumpkin, 6=honey_bunny, 7=honey_bunny, 8=pumpkin, 9=X, 10=mia, 11=vincent, 12=Y, 13=X, 14=Y, 15=Z, 17=V, 16=U}

The code of a symbol is managed since first clause reading as a String. It takes into account Clauses independancy as showed in the following example:



Variable X of clause 1 is set two times and is stacked by two symbols of same code and the other one has another code because it is independant.
Here is a sketch of what's going on when reading a file:


And here on how are they stacked into ListeClauses:



Now What I have to do is a method boolean unif(Clause c): in Clause that returns true if head of the clause c1 can be unified with head of a clause c2:

for instance: loves(vincent, mia). (line1) can be unified with loves(X,mia). (line 5)

there is 3 cases:

Constant/Constant: e.g: Mia/Vincent

Constant/variable: e.g: Mia/X

Variable/variable e.g: X/Y

I'm stuck there on how to do Variable/variable: the first variable has to become the second (or the reverse, no matter).

Here is my new code:

package projetJava; // We have to place a projet.pl file in our workplace import java.awt.Container; import java.awt.GridLayout; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import java.io.*; import java.util.*; import javax.swing.*; class Prolog{ static int content; static int j=0; static int i=0; static String Clauses[]; static String VarAffich []; static Object VarVal[]; static int VarSubst[]; static int maxVar; static String fichier= "projet.pl";// created but empty and inexistent thus creating issues.// How to actually import it? public static void main(String[] args) { String chaine=""; Clauses = new String[12]; VarAffich = new String[maxVar]; VarVal = new Object[maxVar]; VarSubst = new int [maxVar];//reading text file try{ InputStream ips= new FileInputStream(fichier); InputStreamReader ipsr= new InputStreamReader(ips); BufferedReader br= new BufferedReader(ipsr); String ligne; while((ligne=br.readLine())!= null){ Clauses[i]=ligne; System.out.println(ri(i)); i++; } br.close(); System.out.println(Clause.ListeClauses); System.out.println(Annuaire.ValSymbole);// why is it empty? System.out.println(Annuaire.AffSymbole); Clause c1= (Clause)Clause.ListeClauses.get(0); Clause c2 =(Clause)Clause.ListeClauses.get(5); System.out.println(c1.unif(c2));// not constructed yet } catch(Exception e){ System.out.println(e.toString()); e.printStackTrace(); } //We have to create a method that place every symbol of Clauses in a map for (int i = 0; i < Clauses.length; i++) { Annuaire.ValSymbole.put(j,Clauses[i]); // traitement } /* while ((content = Clauses.read()) != -1) { //I want to convert it to char and put it in a map symbol by symbol Annuaire.ValSymbole.put(j, (char) content); j++; }*/ /*for(Object key: Annuaire.ValSymbole.keySet()) System.out.println(key + " - " + Annuaire.ValSymbole.get(key)); System.out.println();*/ } static Clause ri(int noClause){ Clause c = new Clause(); String mot = ""; String mot_old = ""; List liste = new LinkedList(); Clause.Litteral ll = null; Clause.Litteral.Symbole s = null; boolean variables = false; boolean predicat = false; do{ mot_old = mot; mot = parsingClause(noClause); //System.out.println("analyse de: "+mot); if(mot.equals("(")){ variables = true; ll = c.new Litteral(mot_old); c.add(ll); continue; } if(mot.equals(",")){ if(variables){ ll.add(ll.new Symbole(mot_old)); } if(predicat){ predicat = false; c.add( c.new Litteral(mot_old)); } continue; } if(mot.equals(")")){ variables = false; ll.add(ll.new Symbole(mot_old)); continue; } else{// c'est un mot if(predicatConstant(mot)){predicat = true;} continue; } }while (!mot.equals("")); // cas d'un predicat constant en fin de clause: if(predicat){c.add(c.new Litteral(mot_old));} return c; } static boolean delimiteur(char c){ boolean b = false; if(c=='('||c==')'||c==','||c==':')b = true; return b; } static boolean predicatConstant(String p){ boolean b = false; if(p.equals("nl")||p.equals("fail")||p.equals("!")||p.equals("cut")) b = true; return b; } static String parsingClause(int noClause){ String mot=""; while(Clauses[noClause].charAt(0)==' '){ Clauses[noClause]=Clauses[noClause].substring(1); } if(Clauses[noClause].charAt(0)=='.'){ Clauses[noClause]=Clauses[noClause].substring(1);return mot; } if(Clauses[noClause].charAt(0)==':' && Clauses[noClause].charAt(1)=='-'){ Clauses[noClause]=Clauses[noClause].substring(2);return ":-"; } if(delimiteur(Clauses[noClause].charAt(0))){ String r= Character.toString(Clauses[noClause].charAt(0)); Clauses[noClause]=Clauses[noClause].substring(1);return r; } // begining of the word parsing while(!delimiteur(Clauses[noClause].charAt(0))&& Clauses[noClause].charAt(0)!='.'&&Clauses[noClause].charAt(0)!=' ') { mot+=Character.toString(Clauses[noClause].charAt(0)); Clauses[noClause]=Clauses[noClause].substring(1); } return mot; } } class Clause extends LinkedList{ static List ListeClauses = new LinkedList(); List listeVar; List listeCode; List listeLitteraux; int varExiste(String n){ for(int i=0;i<listeVar.size();i++){ if( ((String)listeVar.get(i)).equals(n)) return i; } return -1; } Clause(){ super(); listeVar = new LinkedList(); listeCode = new LinkedList(); System.out.println("creation clause"); listeLitteraux = new LinkedList(); ListeClauses.add(this); } public String toString(){ return super.toString(); } boolean unif (Clause c){ Litteral l1 = (Litteral)get(0); //c'.unif(c) Litteral l2 = (Litteral) c.get(0); if (l1 == l2) return false; else { for (int i = 0; i< l1.size(); i++){ Litteral.Symbole s1 = (Litteral.Symbole) l1.get(i); Litteral.Symbole s2 = (Litteral.Symbole) l2.get(i); } return true;// variable val= null } } class Litteral extends LinkedList{ String predicat; List listeVar; Litteral(String p){ super(); predicat = p;listeVar = new LinkedList();listeLitteraux.add(this); //System.out.println("creation litteral "+predicat); } public String toString(){ return predicat + super.toString(); } public void unif (Litteral l){ if (Character.isUpperCase(l.toString().charAt(0)) && Character.isUpperCase(predicat.toString().charAt(0)) ){// if c/c' is a variable variable case AffSymbole(l)=AffSymbole(predicat); }else if(predicat.equals(l)){// if c/c' is a constant/constant case }else {// if c/c' is a variable/constant case } } class Symbole{ int code; Symbole(String s){ if(varExiste(s)<0){ // nouvelle variable code=Annuaire.Code++; // son code Annuaire.AffSymbole.put(code, s); Annuaire.ValSymbole.put(code, null);//What do we use that? Clause.this.listeVar.add(s); Clause.this.listeCode.add(code); } else{ // la variable existe code=(Integer)listeCode.get(varExiste(s)); //code de la var qui existe } } public String toString(){return Annuaire.aff(code);} }// fin Symbole }// fin Litteral }// fin Clause class Annuaire{ static Map<Integer,Object> ValSymbole = new HashMap<Integer,Object>(); static Map<Integer,String> AffSymbole = new HashMap<Integer,String>(); static String aff(int c){return AffSymbole.get(c);} static Object val(int c){return ValSymbole.get(c);} static int Code=1; }

My, that code is difficult to read. The one design error I can see is frequent use of the keyword static. Why are so many things marked static? If you do not have a good explanation for using the word static, assume it is a serious error. Also why have you got such a long main method?

Antoine Compagnie wrote:Here is my new code: ...

I hope you don't mind, but I've removed the commented class at the bottom, since it doesn't seem relevant to the problem.

Indeed, IMO, including commented-out code in general is a really bad habit (and you have at least one other section).
I realise that you probably put it in there as a reminder for yourself, but there are much better ways to do it.

My preference: Add a comment line starting with:
  // TO DO ...
and containing an English (or, in your case, French) description of WHAT the code needs to do.

Why? Because it reminds you of what you intend to insert, without distracting readers (like us) from what the code actually DOES.
The "// TO DO" tag is also recognised by some IDEs (like Eclipse; not sure about Netbeans).

HIH

Winston

In my Eclipse IDE, the default is // TODO although you can change it.

hello, I have such a long main method because I use it to test my methods.
Many static keywords are from my teacher.
We did comment but without writing explicitly "TO DO".
Should we start with a first line commenting all wwhat the code nee to do? Okay, I will do that.
I'm actually starting to construct the unif method in the class Clause.
Having made up the predicate/predicate case: for instance loves (X,Y) works with loves(Y,Z),

I'm now dealing with the 3 symbol cases:
Constant/Constant: e.g: Mia/Vincent
Constant/variable: e.g: Mia/X
Variable/variable e.g: X/Y

Yet, I have some issues when dealing with them, I will show you.

Hello!

Since last time, I've done some hard work and I have now almost finish!

I can now unify clause to begin a resolution, that is to say, when having:


loves(vincent, mia). loves(marcellus, mia). loves(marcellus, mia). loves(pumpkin, honey_bunny). loves(honey_bunny, pumpkin). loves(X,mia). loves(vincent,Y). jealous(X, Y) :- loves(X, Z), loves(Y, Z).

with the goal
jealous(vincent,marcellus).

To know if Vincent is jealous of Marcellus.

One can see it how does it works in reality here http://swish.swi-prolog.org/example/examples.swinb by copying and pasting the first code on the left and

trace, (jealous(vincent,marcellus)).

on the right to do it step by step.

All of the following code are in my main.

I can do it by hand, that is to say doing:

Clause c1 =(Clause)Clause.ListeClauses.get(6); // taking the goal Clause c2 =(Clause)Clause.ListeClauses.get(7); // taking the one that would be able to unify because it has the same litterals "jealous" System.out.println(c1.unif(c2)); System.out.println("Classe c1 (0) avant " + c1.get(0)); c1.remove(0); System.out.println("Classe c1 (0) après " + c1.get(0)); c2.remove(0); c1.addAll(c2); System.out.println("vérif " + c1); // Clause.ListeClauses.add(c1);// why do we add it? // Next step is to unif c1 and get 5 Clause c3 = (Clause)Clause.ListeClauses.get(5); System.out.println(c1.unif(c3));// all Z should become Y System.out.println("vérif " + c1);// the reverse append in Annuaire Valeur: Y became Z System.out.println("Annuaire Valeur " + Annuaire.ValSymbole); System.out.println("Annuaire Affichage " + Annuaire.AffSymbole); */

First I don't know where does this comes from

COUCOU jealous[X, Y], loves[X, Z], loves[Y, Z]
predicat l1 jealous
predicat l2 jealous
Annuaire Valeur {1=vincent, 2=mia, 3=marcellus, 4=mia, 5=pumpkin, 6=honey_bunny, 7=honey_bunny, 8=pumpkin, 9=null, 10=mia, 11=vincent, 12=null, 13=null, 14=null, 15=null, 17=marcellus, 16=vincent}
Annuaire Affichage {1=vincent, 2=mia, 3=marcellus, 4=mia, 5=pumpkin, 6=honey_bunny, 7=honey_bunny, 8=pumpkin, 9=X, 10=mia, 11=vincent, 12=Y, 13=X, 14=Y, 15=Z, 17=marcellus, 16=vincent}
S1 X
S1 code 13
S2 vincent
S2 code 16
Variable - Constante
Annuaire Valeur {1=vincent, 2=mia, 3=marcellus, 4=mia, 5=pumpkin, 6=honey_bunny, 7=honey_bunny, 8=pumpkin, 9=null, 10=mia, 11=vincent, 12=null, 13=vincent, 14=null, 15=null, 17=marcellus, 16=vincent}
Annuaire Affichage {1=vincent, 2=mia, 3=marcellus, 4=mia, 5=pumpkin, 6=honey_bunny, 7=honey_bunny, 8=pumpkin, 9=X, 10=mia, 11=vincent, 12=Y, 13=vincent, 14=Y, 15=Z, 17=marcellus, 16=vincent}
S1 Y
S1 code 14
S2 marcellus
S2 code 17
Variable - Constante
HOLALALALALALALA true

I tried to modified the code a bit with

Clause c1 =(Clause)Clause.ListeClauses.get(6); System.out.println("COUCOU " + c1); Clause c2 =(Clause)Clause.ListeClauses.get(7); System.out.println("HOLALALALALALALA " + c1.unif(c2));

Last, but definitely not least, I now would like to do it automaticaly, that is to say to do this resolution automaticaly. I tried:

Clause goal= new Clause(); System.out.println("BEGINING"); int ir = Clause.ListeClauses.size()-1; for(int i=0;i<ir-1;i++){ goal=(Clause) Clause.ListeClauses.get(ir -1); if(goal.unif((Clause)Clause.ListeClauses.get(i))){ Clause c2 =(Clause) Clause.ListeClauses.get(ir -1); Clause c1 =(Clause)Clause.ListeClauses.get(i); System.out.println(c1.unif(c2)); c1.remove(0); System.out.println("là ça va?"); System.out.println("Classe c1 (0) après " + c1.get(0));//It's where the issue appears c2.remove(0); c1.addAll(c2);// tconsequently this can't work. System.out.println("vérif " + c1); System.out.println("c1 " + c1); // now we want to unif the new goal with the top. } } br.close();

Which is inspired a lot from the "by hand method". Yet, it doesn't work because of an IndexOutOfBoundsException at line 60.

I notified in the comments where I think it bugs.
Can you help me debugging/understanding this error? I understand what IndexOutOfBoundsException issuer is, And I've written in the comments where it is created, but I want to know it doesn't work in the automate method, because it worked in the by hand one.
I think I am pretty close from the solution. My teacher then send me a blueprint for the automatical method:

IR: résolution indice
ICF: goald indice
INDEX array giving the number of the clause used to construct the unified clause "la résolvante".

IR = ICF while((IR >= ICF){ duplicate clause n° IR unif=false; for(int i = INDEX(IR);i<IR;i++){ dupliquer clause n° i if(unif(clause n° IR,clause n° i)){ create résolvante if(resolvante.size == 0) FIN add résolvante to ListeClauses INDEX(IR) = i+1; IR++; unif=true; }// fin if }//fin for if(!unif) IR—; }//fin while

Can you help me building up from this this loop that would automate the project?

As a reminder, this is my whole new code:

package projetJava; // We have to place a projet.pl file in our workplace import java.awt.Container; import java.awt.GridLayout; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import java.io.*; import java.util.*; import javax.swing.*; class Prolog{ static int content; static int j=0; static int i=0; static String Clauses[]; static String VarAffich []; static Object VarVal[]; static int VarSubst[]; static int maxVar; static String fichier= "projet.pl"; // created but empty and inexistent thus creating issues.// How to actually import it? public static void main(String[] args) { String chaine=""; Clauses = new String[12]; VarAffich = new String[maxVar]; VarVal = new Object[maxVar]; VarSubst = new int [maxVar];//reading text file try{ InputStream ips= new FileInputStream(fichier); InputStreamReader ipsr= new InputStreamReader(ips); BufferedReader br= new BufferedReader(ipsr); String ligne; while((ligne=br.readLine())!= null){ Clauses[i]=ligne; System.out.println(ri(i)); i++; } Clause goal= new Clause(); System.out.println("BEGINING"); int ir = Clause.ListeClauses.size()-1; for(int i=0;i<ir-1;i++){ goal=(Clause) Clause.ListeClauses.get(ir -1); if(goal.unif((Clause)Clause.ListeClauses.get(i))){ Clause c2 =(Clause) Clause.ListeClauses.get(ir -1); Clause c1 =(Clause)Clause.ListeClauses.get(i); System.out.println(c1.unif(c2)); c1.remove(0); System.out.println("là ça va?"); System.out.println("Classe c1 (0) après " + c1.get(0));// c'est ici que ça bug c2.remove(0); c1.addAll(c2);// ca, ça peut pas marcher. System.out.println("vérif " + c1); System.out.println("c1 " + c1); // now we want to unif the new goal with the top. } } br.close(); /*Clause c1 =(Clause)Clause.ListeClauses.get(6); System.out.println("COUCOU " + c1); Clause c2 =(Clause)Clause.ListeClauses.get(7); System.out.println("HOLALALALALALALA " + c1.unif(c2)); System.out.println("Classe c1 (0) avant " + c1.get(0)); c1.remove(0); System.out.println("Classe c1 (0) après " + c1.get(0)); c2.remove(0); c1.addAll(c2); System.out.println("vérif " + c1); // Clause.ListeClauses.add(c1);// why do we add it? // Next step is to unif c1 and get 5 Clause c3 = (Clause)Clause.ListeClauses.get(5); System.out.println(c1.unif(c3));// all Z should become Y System.out.println("vérif " + c1);// the reverse append in Annuaire Valeur: Y became Z System.out.println("Annuaire Valeur " + Annuaire.ValSymbole); System.out.println("Annuaire Affichage " + Annuaire.AffSymbole);*/ } catch(Exception e){ System.out.println(e.toString()); e.printStackTrace(); } //We have to create a method that place every symbol of Clauses in a map for (int i = 0; i < Clauses.length; i++) { Annuaire.ValSymbole.put(j,Clauses[i]); // traitement } /* while ((content = Clauses.read()) != -1) { //I want to convert it to char and put it in a map symbol by symbol Annuaire.ValSymbole.put(j, (char) content); j++; }*/ /*for(Object key: Annuaire.ValSymbole.keySet()) System.out.println(key + " - " + Annuaire.ValSymbole.get(key)); System.out.println();*/ } static Clause ri(int noClause){ Clause c = new Clause(); String mot = ""; String mot_old = ""; List liste = new LinkedList(); Clause.Litteral ll = null; Clause.Litteral.Symbole s = null; boolean variables = false; boolean predicat = false; do{ mot_old = mot; mot = parsingClause(noClause); //System.out.println("analyse de: "+mot); if(mot.equals("(") || mot.equals("[")){ variables = true; ll = c.new Litteral(mot_old); c.add(ll); continue; } if(mot.equals(",")){ if(variables){ ll.add(ll.new Symbole(mot_old)); } if(predicat){ predicat = false; c.add( c.new Litteral(mot_old)); } continue; } if(mot.equals(")") || mot.equals("]")){ variables = false; ll.add(ll.new Symbole(mot_old)); continue; } else{// c'est un mot if(predicatConstant(mot)){predicat = true;} continue; } }while (!mot.equals("")); // cas d'un predicat constant en fin de clause: if(predicat){c.add(c.new Litteral(mot_old));} return c; } static boolean delimiteur(char c){ boolean b = false; if(c=='('||c==')'||c==','||c==':' ||c == '[' ||c == ']')b = true; return b; } static boolean predicatConstant(String p){ boolean b = false; if(p.equals("nl")||p.equals("fail")||p.equals("!")||p.equals("cut")) b = true; return b; } static String parsingClause(int noClause){ String mot=""; while(Clauses[noClause].charAt(0)==' '){ Clauses[noClause]=Clauses[noClause].substring(1); } if(Clauses[noClause].charAt(0)=='.'){ Clauses[noClause]=Clauses[noClause].substring(1);return mot; } if(Clauses[noClause].charAt(0)==':' && Clauses[noClause].charAt(1)=='-'){ Clauses[noClause]=Clauses[noClause].substring(2);return ":-"; } if(delimiteur(Clauses[noClause].charAt(0))){ String r= Character.toString(Clauses[noClause].charAt(0)); Clauses[noClause]=Clauses[noClause].substring(1);return r; } // begining of the word parsing while(!delimiteur(Clauses[noClause].charAt(0))&& Clauses[noClause].charAt(0)!='.'&&Clauses[noClause].charAt(0)!=' ') { mot+=Character.toString(Clauses[noClause].charAt(0)); Clauses[noClause]=Clauses[noClause].substring(1); } return mot; } } class Clause extends LinkedList{ static List ListeClauses = new LinkedList(); List listeVar; List listeCode; List listeLitteraux; int varExiste(String n){ for(int i=0;i<listeVar.size();i++){ if( ((String)listeVar.get(i)).equals(n)) return i; } return -1; } Clause(){ super(); listeVar = new LinkedList(); listeCode = new LinkedList(); System.out.println("creation clause"); listeLitteraux = new LinkedList(); ListeClauses.add(this); } public String toString(){ String r = super.toString(); return r.substring(1, r.length()-1); } boolean unif(Clause c) { // test predicate. Litteral l1 = (Litteral) get(0); // c'.unif(c) Litteral l2 = (Litteral) c.get(0); System.out.println("predicat l1 " + l1.predicat); System.out.println("predicat l2 " + l2.predicat); if (l1.predicat.equals(l2.predicat)) { for (int i = 0; i < l1.size(); i++) { System.out.println("Annuaire Valeur " + Annuaire.ValSymbole); System.out.println("Annuaire Affichage " + Annuaire.AffSymbole); Litteral.Symbole s1 = (Litteral.Symbole) l1.get(i); Litteral.Symbole s2 = (Litteral.Symbole) l2.get(i); System.out.println("S1 " + s1); System.out.println("S1 code " + s1.code); System.out.println("S2 " + s2); System.out.println("S2 code " + s2.code); // Constant vs constant if (Annuaire.val(s1.code) != null && Annuaire.val(s2.code) != null && !(s1.equals(s2))) { System.out.println("Constante - Constante avec s1 != s2 " + s1 + " " + s2 + s1.equals(s2)); return false;//should we write false? it would end the array decomposition } if (Annuaire.val(s1.code) != null && Annuaire.val(s2.code) != null && s1.equals(s2)) { System.out.println("Constante - Constante"); //return false; } // Constante vs variable if (Annuaire.val(s1.code) != null && Annuaire.val(s2.code) == null) { System.out.println("Constante - Variable"); Annuaire.ValSymbole.put(s2.code, s1.toString()); } //variable vs constant if (Annuaire.val(s1.code) == null && Annuaire.val(s2.code) != null) { System.out.println("Variable - Constante"); Annuaire.ValSymbole.put(s1.code, s2.toString()); Annuaire.AffSymbole.put(s1.code, Annuaire.val(s2.code).toString()); } //variable vs variable if(Annuaire.val(s1.code) == null && Annuaire.val(s2.code) == null){ System.out.println("Variable - Variable"); Annuaire.AffSymbole.put(s2.code, s1.toString()); System.out.println( "VERIF "+s2.code+" "+s1.toString()+ " "+Annuaire.val(s1.code)); // traiter le null. //Annuaire.AffSymbole.put(s2.code, Annuaire.val(s1.code).toString()); // Doesn't change??? //java.lang.NullPointerException } } } return true; } static Clause copie (int i){ Clauses[99]=Clause.ListeClauses.get(i).toString()+"."; return ri(99); } class Litteral extends LinkedList{ String predicat; List listeVar; Litteral(String p){ super(); predicat = p;listeVar = new LinkedList();listeLitteraux.add(this); //System.out.println("creation litteral "+predicat); } public String toString(){ if(Prolog.predicatConstant(predicat))return predicat; return predicat+super.toString(); } public void unif (Litteral l){ if (Character.isUpperCase(l.toString().charAt(0)) && Character.isUpperCase(predicat.toString().charAt(0)) ){ // if c/c' is a variable variable case l=AffSymbole(predicat); }else if(predicat.equals(l)){// if c/c' is a constant/constant case }else {// if c/c' is a variable/constant case } } class Symbole{ int code; Symbole(String s){ if(varExiste(s)<0){ // nouvelle variable code=Annuaire.Code++; // son code Annuaire.AffSymbole.put(code, s); if (Character.isUpperCase(s.toString().charAt(0))){ Annuaire.ValSymbole.put(code, null); } else{ Annuaire.ValSymbole.put(code, s.toString()); } //What do we use that? Clause.this.listeVar.add(s); Clause.this.listeCode.add(code); } else{ // la variable existe code=(Integer)listeCode.get(varExiste(s)); //code de la var qui existe } } public String toString(){return Annuaire.aff(code);} public boolean equals(Object symbole){ return ( Annuaire.val(code).toString() .equals ( Annuaire.val(((Symbole)symbole).code).toString())); } }// fin Symbole }// fin Litteral }// fin Clause class Annuaire{ static Map<Integer,Object> ValSymbole = new HashMap<Integer,Object>(); static Map<Integer,String> AffSymbole = new HashMap<Integer,String>(); static String aff(int c){return AffSymbole.get(c);} static Object val(int c){return ValSymbole.get(c);} static int Code=1; }

Please don't write such long lines. I have sorted out the worst offenders, so you can see how to do it in future  Don't use all those // comments because they make the lines longer. A // comment should be very short; those comments should be put on their own lines and changed to /* comments */

Could you post the entire stack trace of error?

Of course for the error code:!

And sorry for long lines, I just did a Ctrl+I and will try to short my lines in the future.

here it is
creation clause loves[vincent, mia] creation clause loves[marcellus, mia] creation clause loves[pumpkin, honey_bunny] creation clause loves[honey_bunny, pumpkin] creation clause loves[X, mia] creation clause loves[vincent, Y] creation clause jealous[X, Y], loves[X, Z], loves[Y, Z] creation clause jealous[vincent, marcellus] creation clause BEGINING predicat l1 jealous predicat l2 loves predicat l1 loves predicat l2 jealous true là ça va? java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 at java.util.LinkedList.checkElementIndex(LinkedList.java:553) at java.util.LinkedList.get(LinkedList.java:474) at projetJava.Prolog.main(Prolog.java:58)

Antoine Compagnie wrote:Last, but definitely not least, I now would like to do it automaticaly, that is to say to do this resolution automaticaly. I tried:
Which is inspired a lot from the "by hand method". Yet, it doesn't work because of an IndexOutOfBoundsException at line 60.

OK, well the only section of that method that seems to use get() is this one:int ir = Clause.ListeClauses.size() - 1; for(int i = 0; i < ir - 1; i++) { goal = (Clause) Clause.ListeClauses.get(ir - 1); if (goal.unif( (Clause) Clause.ListeClauses.get(i) )) { Clause c2 = (Clause) Clause.ListeClauses.get(ir - 1); Clause c1 = (Clause) Clause.ListeClauses.get(i); ...and since the error message is telling you that the size is 0, it would appear that Clause.ListeClauses is empty. But why that is, I have no idea.

You could do yourself a lot of favours by
(a) spacing out your code a bit (as I've done above). Right now it's very difficult to read.
(b) making ListClauses a List<Clause> instead of just a List. That would save you having to cast every time you get() a value.

I'm also a little puzzled by that section above:

First you set ir to the index of the last element in ListClauses (or -1 if it's empty).

Next you create a loop that goes through every element except the last one.

Next you set 'goal' to the element before the last one.

Then you do a bunch of other stuff.

It seems incredibly tortuous to me; and plainly isn't going to work if ListClauses has less than two elements in it - which is definitely the case here.

Why don't you back up a bit and think about what that loop is supposed to do? It seems to me that you're just adding more and more code with no real plan.

Winston

First :ir Resolution Indice: is where the goal is. It will increase as far as we are creating new goals through resolutions.

Next, I loop over every line but the last one, that's okay as far as we are first looking for the first possible clause to unify with the goal.

Next you set 'goal' to the element before the last one.

goal=(Clause) Clause.ListeClauses.get(ir -1);

Should I do

goal=(Clause) Clause.ListeClauses.get(ir);

to set is as the goal?

plainly isn't going to work if ListClauses has less than two elements in it - which is definitely the case here.

Okay, listClause have to have two elements. Else remove(0) will leave and empty collection.
Yet, why was it working during the by hand method? Actually when I have
jealous(X, Y) :- loves(X, Z), loves(Y, Z). jealous(vincent,marcellus).

I have to have after unif, remove andall:
loves(vincent, Z), loves(vincent, Z).

Here is what I did with the byhand method.

Clause c1 =(Clause)Clause.ListeClauses.get(6); Clause c2 =(Clause)Clause.ListeClauses.get(7); c1.remove(0); c2.remove(0); c1.addAll(c2);
And if I do

System.out.println("vérif " + c1);

I get:

vérif loves[vincent, Z], loves[Y, Z]

Which is almost what I want, it lacks Y transformation.

Antoine Compagnie wrote:Should I do
goal=(Clause) Clause.ListeClauses.get(ir);
to set is as the goal?

I suspect so, but what you really need to do is step back from the problem and ask yourself this:
  WHAT is that loop trying to do?
and write down answer in English (or French).

It seems to me that your approach is rather "existential", and while Jean-Paul Sartre was a great Frenchman, he would not have made a great programmer.

This is is a difficult problem, so you're not going to solve it simply by coding. You need some structure to that code (and very likely to the objects in it); but in order to get there, you first need to understand the problem as a whole rather than just tackling it as a coding exercise.

Just to give you an idea: If this was me, and since I don't know much about Prolog, I would probably have spent at least a week (and possibly a month) reading about the language, drawing diagrams, and writing out definitions and scenarios. I'd want to understand exactly what makes a Prolog program tick, and how the various elements of clause, fact, variable and term fit together before I wrote my first line of code.

Unfortunately, you're a long way down the "coding" path, and I suspect you have a lot of time and effort invested in it. And that is precisely what I see - a lot of code. It looks brittle and monolithic, and difficult to change and understand; so the only things I can suggest for advice are some simple guidelines:

Stop Coding.

No method - including main() - should be longer than 20 lines; and preferably shorter.

Don't be afraid of creating classes. You appear to have 3, where I would expect around a dozen (6 at the very least).

Don't make anything static unless you have a VERY good reason.

Sorry if this sounds harsh, but I honestly think you're headed for trouble. You might get a program that works, but it'll only be after a lot of blood, sweat and tears. And even then, it's likely to be difficult to change later on if you need to.

HIH

Winston

You were right!

I just stop coding for a day did some tests on some Prolog examples.

The loop was awful, I did it again
after testing my code bit by bit I noticed that the error was that i didn't did all what was needed to to do the unifcation.
The constant vs variable part was missing the Symbol diplaying modifications after unifying:

// Constante vs variable if (Annuaire.val(s1.code) != null && Annuaire.val(s2.code) == null) { System.out.println("Constante - Variable"); Annuaire.ValSymbole.put(s2.code, s1.toString()); //SOMETHING MISSING HERE!!! } //variable vs constant if (Annuaire.val(s1.code) == null && Annuaire.val(s2.code) != null) { System.out.println("Variable - Constante"); Annuaire.ValSymbole.put(s1.code, s2.toString()); Annuaire.AffSymbole.put(s1.code, Annuaire.val(s2.code).toString());

Now, it's almost done. All I have to do is to loop over the loop with a while until the goal can't be unified anymore with any clauses.
To do that I will have to add a goal each time I unify and exit the inner loop to iterate again over the clauses.


I liked you joke on Jean-Paul!
I will post my code when I think it will be ready enough for facing your judgments. Actually my main has only 40 lines of really used code! The rest is ruins of avorted ideas that can still help me!

Okay, here it is, the first version to work:

Alas! it only work for simple resolution questions. It semms not to be okay for more complex programs such as

write,nl

rules

This file projet.pl with the question asked on the last line, I mean if vincent is jealous of Marcellus, would work.

loves(vincent, mia). loves(marcellus, mia). loves(marcellus, mia). loves(pumpkin, honey_bunny). loves(honey_bunny, pumpkin). loves(X,mia). loves(vincent,Y). jealous(X, Y) :- loves(X, Z), loves(Y, Z). jealous(vincent,marcellus).

Whereas this one: magasin.pl wouldn't as far as there are now new thing to apply such as write and new line.

mag(paris,mag_a). mag(paris,mag_b). mag(lyon,mag_c). mag(lyon,mag_d). listeM(M):-mag(V,M),write(M),write( situe_a ),write(V),nl. listeM(X).

Furthermore, my teacher told me my code would not gives right answers if I had to apply it on example such as:

loves(X,mia). loves(vincent,Y).

In the first example they are not used. They mean everybody loves mia and vincent loves everybody.

No need to wait more, I'm giving you this code and the one my teacher gived me if I wasn't able to cope with this two new challenges.

package projetJava; // We have to place a projet.pl file in our workplace import java.awt.Container; import java.awt.GridLayout; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import java.io.*; import java.util.*; import javax.swing.*; //we have to create a new clause jealous(vincent,marcellus):loves(vincent,Z),loves(marcellus,Z) class Prolog{ static int content; static int j=0; static int i=0; static String Clauses[] = new String [120]; static String VarAffich []; static Object VarVal[]; static int VarSubst[]; static int maxVar = 200; static String fichier= "magasin.pl";// created but empty and inexistent thus creating issues.// How to actually import it? public static void main(String[] args) { String chaine=""; Clauses = new String[12]; VarAffich = new String[maxVar]; VarVal = new Object[maxVar]; VarSubst = new int [maxVar];//reading text file try{ InputStream ips= new FileInputStream(fichier); InputStreamReader ipsr= new InputStreamReader(ips); BufferedReader br= new BufferedReader(ipsr); String ligne; while((ligne=br.readLine())!= null){ Clauses[i]=ligne; System.out.println(ri(i)); i++; } br.close();} catch (Exception e){ System.out.println(e.toString()); } System.out.println("\n BEGINING"); int ir = Clause.ListeClauses.size()-1; Clause goal=new Clause(); goal =(Clause) Clause.ListeClauses.get(ir); Clause newGoal =new Clause(); boolean result = false; while (goal!=newGoal){ newGoal=(Clause) goal.clone(); for(int i=0;i<ir;i++){ Clause c1 =new Clause(); c1 =(Clause)Clause.ListeClauses.get(i); System.out.println("c" +i + ": "+ c1); System.out.println("goal: " + goal); /* if (c1.equals(goal)){ result =true; break; }*/ if (goal.unif(c1)){ goal.remove(0); c1.remove(0); goal.addAll(c1); System.out.println("UNIFICATION DONE\ngoal: " + goal+"\n**********"); } if(goal.isEmpty()){ result = true; System.out.println("result " + result); return; } } } System.out.println("\n\n\nSECOND LOOP, NEVER TO BE ENTERED"); for(int i=0;i<ir;i++){ Clause c1 =new Clause(); c1 =(Clause)Clause.ListeClauses.get(i); System.out.println("c" +i + ": "+ c1); System.out.println("goal: " + goal); if (goal.unif(c1)){ goal.remove(0); c1.remove(0); goal.addAll(c1); System.out.println("UNIFICATION N°2 EFFECTUEE\ngoal: " + goal+"\n!!!!!!!"); Clause.ListeClauses.add(goal); } } System.out.println("result " + result); //We have to create a method that places every symbol of Clauses in a map for (int i = 0; i < Clauses.length; i++) { Annuaire.ValSymbole.put(j,Clauses[i]); // traitement } } static Clause ri(int noClause){ Clause c = new Clause(); String mot = ""; String mot_old = ""; List liste = new LinkedList(); Clause.Litteral ll = null; Clause.Litteral.Symbole s = null; boolean variables = false; boolean predicat = false; do{ mot_old = mot; mot = parsingClause(noClause); //System.out.println("analyse de: "+mot); if(mot.equals("(") || mot.equals("[")){ variables = true; ll = c.new Litteral(mot_old); c.add(ll); continue; } if(mot.equals(",")){ if(variables){ ll.add(ll.new Symbole(mot_old)); } if(predicat){ predicat = false; c.add( c.new Litteral(mot_old)); } continue; } if(mot.equals(")") || mot.equals("]")){ variables = false; ll.add(ll.new Symbole(mot_old)); continue; } else{// c'est un mot if(predicatConstant(mot)){predicat = true;} continue; } }while (!mot.equals("")); // cas d'un predicat constant en fin de clause: if(predicat){c.add(c.new Litteral(mot_old));} return c; } static boolean delimiteur(char c){ boolean b = false; if(c=='('||c==')'||c==','||c==':' ||c == '[' ||c == ']')b = true; return b; } static boolean predicatConstant(String p){ boolean b = false; if(p.equals("nl")||p.equals("fail")||p.equals("!")||p.equals("cut")) b = true; return b; } static String parsingClause(int noClause){ String mot=""; while(Clauses[noClause].charAt(0)==' '){ Clauses[noClause]=Clauses[noClause].substring(1); } if(Clauses[noClause].charAt(0)=='.'){ Clauses[noClause]=Clauses[noClause].substring(1);return mot; } if(Clauses[noClause].charAt(0)==':' && Clauses[noClause].charAt(1)=='-'){ Clauses[noClause]=Clauses[noClause].substring(2);return ":-"; } if(delimiteur(Clauses[noClause].charAt(0))){ String r= Character.toString(Clauses[noClause].charAt(0)); Clauses[noClause]=Clauses[noClause].substring(1);return r; } // begining of the word parsing while(!delimiteur(Clauses[noClause].charAt(0))&& Clauses[noClause].charAt(0)!='.'&&Clauses[noClause].charAt(0)!=' ') { mot+=Character.toString(Clauses[noClause].charAt(0)); Clauses[noClause]=Clauses[noClause].substring(1); } return mot; } } class Clause extends LinkedList{ static List ListeClauses = new LinkedList(); List listeVar; List listeCode; List listeLitteraux; int varExiste(String n){ for(int i=0;i<listeVar.size();i++){ if( ((String)listeVar.get(i)).equals(n)) return i; } return -1; } Clause(){ super(); listeVar = new LinkedList(); listeCode = new LinkedList(); System.out.println("creation clause"); listeLitteraux = new LinkedList(); ListeClauses.add(this); } public String toString(){ String r = super.toString(); return r.substring(1, r.length()-1); } boolean unif(Clause c) { // test predicate. Litteral l1 = (Litteral) get(0); // c'.unif(c) Litteral l2 = (Litteral) c.get(0); System.out.println("predicat l1 " + l1.predicat); System.out.println("predicat l2 " + l2.predicat); if (l1.predicat.equals(l2.predicat)) { for (int i = 0; i < l1.size(); i++) { System.out.println("Annuaire Valeur " + Annuaire.ValSymbole); System.out.println("Annuaire Affichage " + Annuaire.AffSymbole); Litteral.Symbole s1 = (Litteral.Symbole) l1.get(i); Litteral.Symbole s2 = (Litteral.Symbole) l2.get(i); System.out.println("S1 " + s1); System.out.println("S1 code " + s1.code); System.out.println("S2 " + s2); System.out.println("S2 code " + s2.code); // Constant vs constant if (Annuaire.val(s1.code) != null && Annuaire.val(s2.code) != null && !(s1.equals(s2))) { System.out.println("Constante - Constante avec s1 != s2 " + s1 + " " + s2 + s1.equals(s2)); return false;//should we write false? it would end the array decomposition } if (Annuaire.val(s1.code) != null && Annuaire.val(s2.code) != null && s1.equals(s2)) { System.out.println("Constante - Constante"); } // Constante vs variable if (Annuaire.val(s1.code) != null && Annuaire.val(s2.code) == null) { System.out.println("Constante - Variable"); Annuaire.ValSymbole.put(s2.code, s1.toString()); Annuaire.AffSymbole.put(s2.code, Annuaire.val(s1.code).toString()); } //variable vs constant if (Annuaire.val(s1.code) == null && Annuaire.val(s2.code) != null) { System.out.println("Variable - Constante"); Annuaire.ValSymbole.put(s1.code, s2.toString()); Annuaire.AffSymbole.put(s1.code, Annuaire.val(s2.code).toString()); } //variable vs variable if(Annuaire.val(s1.code) == null && Annuaire.val(s2.code) == null){ System.out.println("Variable - Variable"); Annuaire.AffSymbole.put(s2.code, s1.toString()); System.out.println("VERIF "+s2.code+" "+s1.toString()+ " "+Annuaire.val(s1.code)); // traiter le null. //Annuaire.AffSymbole.put(s2.code, Annuaire.val(s1.code).toString());// Doesn't change??? //java.lang.NullPointerException } if(l1.predicat.contentEquals("write")){ ; } } return true; } // entrySet sur valeur & que l'élément correspondant change, alors là!!! return false; } static Clause copie (int i){ Clauses[99]=Clause.ListeClauses.get(i).toString()+"."; return ri(99); } class Litteral extends LinkedList{ String predicat; List listeVar; Litteral(String p){ super(); predicat = p;listeVar = new LinkedList();listeLitteraux.add(this); //System.out.println("creation litteral "+predicat); } public String toString(){ if(Prolog.predicatConstant(predicat))return predicat; return predicat+super.toString(); } public void unif (Litteral l){ if (Character.isUpperCase(l.toString().charAt(0)) && Character.isUpperCase(predicat.toString().charAt(0)) ){// if c/c' is a variable variable case l=AffSymbole(predicat); }else if(predicat.equals(l)){// if c/c' is a constant/constant case }else {// if c/c' is a variable/constant case } } class Symbole{ int code; Symbole(String s){ if(varExiste(s)<0){ // nouvelle variable code=Annuaire.Code++; // son code Annuaire.AffSymbole.put(code, s); if (Character.isUpperCase(s.toString().charAt(0))){ Annuaire.ValSymbole.put(code, null); } else{ Annuaire.ValSymbole.put(code, s.toString()); } //What do we use that? Clause.this.listeVar.add(s); Clause.this.listeCode.add(code); } else{ // la variable existe code=(Integer)listeCode.get(varExiste(s)); //code de la var qui existe } } public String toString(){return Annuaire.aff(code);} public boolean equals(Object symbole){ return ( Annuaire.val(code).toString() .equals (Annuaire.val(((Symbole)symbole).code).toString())); } }// fin Symbole }// fin Litteral }// fin Clause class Annuaire{ static Map<Integer,Object> ValSymbole = new HashMap<Integer,Object>(); static Map<Integer,String> AffSymbole = new HashMap<Integer,String>(); static String aff(int c){return AffSymbole.get(c);} static Object val(int c){return ValSymbole.get(c);} static int Code=1; }

Therefore the following one is from my teacher, one as to notice that he used array for ListeClauses rather than LinkedList.
It allows him to do something I can't that is to say to add his new resolution clause furhter down and to navigate better between, step by step when they can't be unified.

package ProjetMichel; // source.txt doit etre ds le rép. du projet // IMPORTANT: la derniere ligne doit être vide // IR compte les clauses et sert d'indice de resolution import java.io.*; import java.util.*; // Clause ci Litteral ci Symbole public class ProjetMichel { static String fichier ="source.pl"; static String[] Clauses= new String[120]; static int cptVar = 0; static int maxVar = 200; static String[] VarAffich; static Object[] VarVal; static int[] VarSubst; static Clause Resolvante; static int IR=-1; static int ICF; //AJOUT static List listeCode; static List listeSymbole; static List listeAff; static int code; static int varExiste(String n){ for(int i=0;i<listeAff.size();i++){ if( ((String)listeAff.get(i)).equals(n)) return i; } return -1; } public static void main(String[] args) { String chaine=""; VarAffich = new String[maxVar]; VarVal = new Object[maxVar]; VarSubst = new int[maxVar];String ligne=""; //lecture du fichier texte try{ InputStream ips=new FileInputStream(fichier); InputStreamReader ipsr=new InputStreamReader(ips); BufferedReader br=new BufferedReader(ipsr); Clauses = new String[100]; for(int i=0;i<100;i++)Clauses[i]=""; boolean suite; int i=0; while ((ligne=br.readLine())!=null){ suite = false; System.out.println(ligne); Clauses[i]+=ligne; if(ligne.charAt(ligne.length()-1)!='.') {Clauses[i]+=" ";continue;} i++; chaine+=ligne+"\n"; } br.close(); } catch (Exception e){ //System.out.println("Erreur "+ligne.charAt(ligne.length()-1)+e.toString()); } // transformation des clauses et calcul de IR int k = 0; while(!Clauses[k].equals("")){;analyse(k);k++;} System.out.println("SUITE IR "+IR); for(int i=0;i<=IR;i++)System.out.println("LISTE "+Clause.ListeClauses[i]); System.out.println("Debut RESOLUTION IR "+IR); resolution(Clause.ListeClauses); for(int i=0;i<=IR;i++)System.out.println("Liste "+Clause.ListeClauses[i]); } static Clause analyse(int noClause){ Clause c=new Clause(); String mot = ""; String mot_old = ""; List liste = new LinkedList(); Clause.Litteral lit = null; Clause.Litteral.Symbole s = null; boolean variables = false; boolean predicat = false; //AJOUT listeCode = new LinkedList(); listeSymbole = new LinkedList(); listeAff = new LinkedList(); do{ mot_old = mot; mot = parsingClause(noClause); if(mot.equals("(")||mot.equals("[")){ variables = true; lit = c.new Litteral(mot_old); c.add(lit); continue; } if(mot.equals(",")){ if(variables){ //AJOUT //System.out.println("symbole analyse "+mot_old); if(varExiste(mot_old)==-1){ //System.out.println(mot_old+" n'existe pas "+listeAff); code=Annuaire.Code++;// Annuaire.AffSymbole.put(code, mot_old); if(mot_old.charAt(0)>='A'&&mot_old.charAt(0)<='Z'){ Annuaire.ValSymbole.put(code, null); }else Annuaire.ValSymbole.put(code, mot_old); s = lit.new Symbole(mot_old); s.code = code; lit.add(s); listeCode.add(code); listeSymbole.add(s); listeAff.add(mot_old); } else{ //var deja rencontree //System.out.println(mot_old+" existe"+varExiste(mot_old)); lit.add(listeSymbole.get(varExiste(mot_old))); } } if(predicat){ predicat = false; c.add( c.new Litteral(mot_old)); } continue; } if(mot.equals(")")||mot.equals("]")){ variables = false; // verifier existence du symb. if(varExiste(mot_old)==-1){ //System.out.println(mot_old+" n'existe pas "+listeAff); code=Annuaire.Code++;// Annuaire.AffSymbole.put(code, mot_old); if(mot_old.charAt(0)>='A'&&mot_old.charAt(0)<='Z'){ Annuaire.ValSymbole.put(code, null); }else Annuaire.ValSymbole.put(code, mot_old); s = lit.new Symbole(mot_old); s.code = code; lit.add(s); listeCode.add(code); listeSymbole.add(s); listeAff.add(mot_old); } else{ //var deja rencontree //System.out.println(mot_old+" existe"+varExiste(mot_old)); lit.add(listeSymbole.get(varExiste(mot_old))); } continue; } else{// c'est un mot if(predicatConstant(mot)){predicat = true;} continue; } }while (!mot.equals("")); // cas d'un predicat constant en fin de clause: if(predicat){c.add(c.new Litteral(mot_old));} //AJOUT //il faut changer le nom des variables en y incorporant le nom (var uniquement) for(int i=0;i<listeCode.size();i++){ if( Annuaire.val((Integer)listeCode.get(i))==null ) Annuaire.AffSymbole.put((Integer)listeCode.get(i),listeAff.get(i)+listeCode.get(i).toString()); } System.out.println("CLAUSE "+c); Clause.ListeClauses[++IR] = c; return c; } static boolean delimiteur(char c){ boolean b = false; if(c=='('||c==')'||c==','||c==':'||c=='['||c==']')b = true; return b; } static boolean predicatConstant(String p){ boolean b = false; if(p.equals("nl")||p.equals("fail")||p.equals("!")||p.equals("cut")) b = true; return b; } static boolean variable(Object s){ boolean b = false; String ch; if(s instanceof String){ ch = (String)s; if(ch.charAt(0)>='A'&&ch.charAt(0)<='Z')b = true; } if(s instanceof Integer){ return true; } return b; } static String parsingClause(int noClause){ String mot=""; //System.out.println("DEBUG "+Clauses[noClause].charAt(0)); while(Clauses[noClause].charAt(0)==' ')Clauses[noClause]=Clauses[noClause].substring(1); if(Clauses[noClause].charAt(0)=='.'){Clauses[noClause]=Clauses[noClause].substring(1);return mot;} if(Clauses[noClause].charAt(0)==':' && Clauses[noClause].charAt(1)=='-'){ Clauses[noClause]=Clauses[noClause].substring(2); return ":-"; } if(delimiteur(Clauses[noClause].charAt(0))){ String r= Character.toString(Clauses[noClause].charAt(0)); Clauses[noClause]=Clauses[noClause].substring(1); return r; } // debut lecture mot while(!delimiteur(Clauses[noClause].charAt(0))&&Clauses[noClause].charAt(0)!='.'&&Clauses[noClause].charAt(0)!=' '){ mot+=Character.toString(Clauses[noClause].charAt(0)); Clauses[noClause]=Clauses[noClause].substring(1);//System.out.println("DEBUG "+Clauses[noClause].charAt(0)); } return mot; } static void resolution(Clause[] lc){ for(int i=0;i<=IR;i++)System.out.print(lc[i]+" / "); System.out.println(); boolean unif; List res; Resolvante = lc[IR];//(Clause)lc.get(lc.size()-1); ICF=IR; int[] Index = new int[100]; while(IR >= ICF){ unif = false; Clause copieResolvante = Clause.copie(IR); for(int i=Index[IR];i<IR;i++){ Clause courante = Clause.copie(i); System.out.println("on cherche a resoudre but "+copieResolvante+" avec "+courante+" "+IR); res = copieResolvante.unif(courante); if(res==null)continue; if (res.size()==0){ System.out.println("Succès !"); return; } if(res.size()>0){//succes unification Index[IR-1]=i+1; //IR++; unif = true; System.out.println("Resultat Unification"); for(int k=0;k<=IR;k++)System.out.print(Clause.ListeClauses[k]+" / "); //for(int ii=0;ii<=Prolog.IR;i++)System.out.print(Clause.ListeClauses[ii]+" / "); System.out.println(); break; } }//fin for if(!unif)IR--; } System.out.println("Echec !"); } } class Annuaire{ static Map<Integer,Object> ValSymbole = new HashMap<Integer,Object>(); static Map<Integer,String> AffSymbole = new HashMap<Integer,String>(); static String aff(int c){return AffSymbole.get(c);} static Object val(int c){return ValSymbole.get(c);} static int Code=1; } class Clause extends LinkedList{ static Clause[] ListeClauses = new Clause[100]; List listeVar; List listeLitteraux; List listeCode; int varExiste(String n){ for(int i=0;i<listeVar.size();i++){ if( ((String)listeVar.get(i)).equals(n)) return i; } return 0; } Clause(){ super(); listeVar = new LinkedList(); listeCode = new LinkedList(); //System.out.println("creation clause"); listeLitteraux = new LinkedList();/*ListeClauses[IC++]=this;*/} public String toString(){String r= super.toString();return r.substring(1, r.length()-1);} class Litteral extends LinkedList{ String predicat; List listeVar; @SuppressWarnings("rawtypes") Litteral(String p){ super(); predicat = p;listeVar = new LinkedList();listeLitteraux.add(this); //System.out.println("creation litteral "+predicat); } //public String toString(){return super.toString();} class Symbole{ int code; String aff; String affI; Object val; Symbole(String s){ //System.out.println("creation symbole "+s); //super(); //int v = varExiste(s); //SUPPRESSION /* if(varExiste(s)==0){ System.out.println(s+" existe"); code=Annuaire.Code++;// Annuaire.AffSymbole.put(code, s); if(s.charAt(0)>='A'&&s.charAt(0)<='Z'){ Annuaire.ValSymbole.put(code, null); }else Annuaire.ValSymbole.put(code, s); Clause.this.listeVar.add(s); Clause.this.listeCode.add(code); } else{ System.out.println("toto "+varExiste(s)); code=(Integer)listeCode.get(varExiste(s));//celui de la var qui existe } affI = s; */ //System.out.println("creation symbole "+affI); } public String toString(){return Annuaire.aff(code);} Object getVal(){return null;} String getAff(){return affI;} boolean libre(){return true;} } public String toString(){ if(ProjetMichel.predicatConstant(predicat))return predicat; return predicat+super.toString(); } } static Clause copie(int i){ ProjetMichel.Clauses[99]=Clause.ListeClauses[i].toString()+"."; Clause c = ProjetMichel.analyse(99); //il faut retirer la clause ajouté à listeClauses[] ProjetMichel.IR--; return c; } List unif(Clause c){ Clause res = new Clause(); Clause.Litteral l1 = (Clause.Litteral)get(0); Clause.Litteral l2 =(Clause.Litteral)c.get(0); System.out.println("unif entre "+this+" et "+c); if(!l1.predicat.equals(l2.predicat))return null; for(int i=0;i<l1.size();i++){ Clause.Litteral.Symbole s1 = (Clause.Litteral.Symbole)l1.get(i); Clause.Litteral.Symbole s2 = (Clause.Litteral.Symbole)l2.get(i); System.out.println("cas "+s1+" "+s2); //cas var/cste if(Annuaire.val(s1.code)==null && Annuaire.val(s2.code)!=null){ System.out.println("var/cste"); Annuaire.ValSymbole.put(s1.code, Annuaire.val(s2.code)); Annuaire.AffSymbole.put(s1.code, Annuaire.aff(s2.code));continue; } //cas cste/var if(Annuaire.val(s2.code)==null && Annuaire.val(s1.code)!=null){ System.out.println("cste/var"); Annuaire.ValSymbole.put(s2.code, Annuaire.val(s1.code)); Annuaire.AffSymbole.put(s2.code, Annuaire.aff(s1.code));continue; } //cas cste/cste if(Annuaire.val(s1.code)!=null && Annuaire.val(s2.code)!=null){ } //cas var/var if(Annuaire.val(s1.code)==null && Annuaire.val(s2.code)==null){ } } Clause nc = new Clause(); for(int i=1;i<c.size();i++)nc.add(c.get(i)); for(int i=1;i<size();i++)nc.add(get(i)); ListeClauses[++ProjetMichel.IR] = nc; return nc; } }

Antoine Compagnie wrote:the following one is from my teacher

Sorry, but I can't say that I'm impressed. That code does not meet my standards for readability or for basic "cleanliness". The fact that an instructor gave this to his/her students just confirms my belief that folks in academia are out of touch with industry best practices and are contributing to the problem of bad code flooding our applications in the real world.

I know... :'(

But... I have to use it anyway. Mine does the work but isn't really cleaner!

I added in his code

//cas cste/cste if(Annuaire.val(s1.code)!=null && Annuaire.val(s2.code)!=null){ System.out.println("Constante - Constante avec s1 != s2 " + s1 + " " + s2 + s1.equals(s2)); break;//should we write false? it would end the array decomposition } //cas var/var if(Annuaire.val(s1.code)==null && Annuaire.val(s2.code)==null){ System.out.println("Variable - Variable"); Annuaire.AffSymbole.put(s2.code, s1.toString()); System.out.println("VERIF "+s2.code+" "+s1.toString()+ " "+Annuaire.val(s1.code)); // traiter le null. Annuaire.ValSymbole.put(s2.code, Annuaire.val(s1.code).toString());// Doesn't change??? //java.lang.NullPointerException }

and received:

Exception in thread "main" java.lang.NullPointerException at ProjetMichel.Clause.unif(ProjetMichel.java:374) at ProjetMichel.ProjetMichel.resolution(ProjetMichel.java:229) at ProjetMichel.ProjetMichel.main(ProjetMichel.java:69)

I'm quite depressed letting my code for his own... But I think this is common in the industry...I will make it!

Antoine Compagnie wrote:Alas! it only work for simple resolution questions. It semms not to be okay for more complex programs such as

write,nl

rules

And what's that supposed to do?

I'm afraid that the problem for me is that I simply don't understand enough about Prolog to advise you; so the "program" above simply looks like gibberish to me.
If I had a few weeks to spend learning the language and understanding the relationships between clauses, literals and symbols and how they are used when posed a query, it would be different - but unfortunately, I don't.

What I can say is that I don't like your teacher's program at all - even if it does work.

It's messy (ie, badly organised, with methods, constructors and member class declarations mixed together apparently at random).

It's badly documented - actually not documented at all, AFAICS.

It doesn't use generics, so it contains several "raw" Lists.

The entire logic is crammed into one file, including a double-nested inner class (Clause→Litteral→Symbole) - something I've never seen before.

It contains far too many static methods for my liking.

It accesses class internals (almost none of which are private) directly, rather than via "getter" methods.

Clause contains a static array of clauses (ListeClauses).
Even presuming that such a thing is desirable, wouldn't it be better to make it a List (or actually, a List<Clause>)?

Now some things (like the lack of documentation) may be deliberate, but the rest is not.
However, since it's what you've been given, here's my suggestion:
1. Print out a copy of each and place them side-by-side.
2. Go through them both, trying to work out what it is that your teacher has done differently to you, especially in some of the loops; and particularly the analyse(), parsingClause() and unif() methods.

It might at least point out some of your logic errors, and explain why your program doesn't work in all cases (assuming that your teacher's does).

HIH

Winston

Thank you for still consideing my issues then!

I will try to use your advises to improve his code.

His code doesn't do all the work. He left some things in order to let us work on it such as the var var case const/const or the rules...

write is used to write the given clause

nl print a new line

listeM(M):-mag(V,M),write(M),write( situe_a ),write(V),nl.

We will have for instance
Magasin Youpi! situé à Paris

Which means Shop Youpi! located in Paris.

rules ar special cases when there is variables in a clause which is not the goal

loves(X,mia). loves(vincent,Y).

Here it means that everybody loves mia and vincent loves everybody.

All of this has to be written out when unification is done, that is to say when boolean unif(Clause c) is called.

Dear all,

this is almost done. Thanks for all your support and help. I have to finish it for Tuesday then it will be done. I'm able to deal with the following files apart from the love/hate relationship:

A way to know which stores are located in which cities:
mag(paris,mag_a). mag(paris,mag_b). mag(lyon,mag_c). mag(lyon,mag_d). liste(M):-mag(V,M),write(M),write( located_in ),write(V),nl,fail. liste(X).

Yet, I'm not able to deal with the "cut/!", which makes a Clause readable only once.

loc(paris). loc(lyon). mag(paris,mag_a). mag(paris,mag_b). mag(lyon,mag_c). mag(lyon,mag_d). ville(V):-loc(V),local(V,M),fail. ville(X):-write(fin_liste_villes). local(V,M):-mag(V,M),write(V),nl,!. ville(X).

But that's not the most important. The most important is that I have yet to deal with the predicate :- which precise what a clause is made of.
It seems from SWISH that even if the goal has the same litteral than the first clause it has firs to unify with the one with ":-"
I tried during hours to make it work the right way but still
My last will here on this topic is your help to revert this loop, to make it clear for the program to start with :- clause:


For example let's take the multiplication of 2 by 3
multi(X,1,X). multi(X,Y,R):-plus(Y1,1,Y),multi(X,Y1,R1),plus(R1,X,R). multi(2,3,R),write(R).

if unifying with the first clause it would give write(R) has an output with nothing in it.
The second case would give 6, the actual result of the multiplication of 2 by 3.

I'm going to give you my code but in order to change the step by step method to the classic display method, two variables have to be modified: display and caseDisplay which are boolean

The first one shows how does the resolution is being processed clause by clause.
The second one shows how does cases are managed.

The for loop I am talking about is the following one:

for(int i=Index[IR];i<IR;i++){ Clause courante = Clause.copie(i); Clause.Litteral l = (Clause.Litteral)copieResolvante.listeLitteraux.get(0); String enterChar = ((Clause.Litteral)copieResolvante.listeLitteraux.get(0)).predicat; if ( (enterChar.equals("write") || enterChar.equals("nl") || enterChar.equals("fail")||enterChar.equals("!"))||enterChar.equals("plus") && cptrLit <= copieResolvante.listeLitteraux.size()-1){ if(cptrLit > copieResolvante.listeLitteraux.size()- 1 ){ break; } while(((Clause.Litteral)copieResolvante.listeLitteraux.get(cptrLit)).predicat.equals("write")){ Clause.Litteral.Symbole s = (Clause.Litteral.Symbole)l.get(0); cptrLit++; //System (enterChar.equals("write") || enterChar.equals("nl") || enterChar.equals("fail")).out.println("copieResolvante : "+ copieResolvante.listeLitteraux.size()); if((cptrLit > copieResolvante.listeLitteraux.size()- 1 )||(copieResolvante.isEmpty())){ break; } l = (Clause.Litteral)copieResolvante.listeLitteraux.get(cptrLit);// why? System.out.println(s); //HERE WE TRIED TO DELETE THE WRITE AND NL copieResolvante.remove(0); if(display){ System.out.println("\n\nCOPIE RESOLVANTE: " + copieResolvante); } } if(cptrLit > copieResolvante.listeLitteraux.size()- 1 ){ break; } if(((Clause.Litteral)copieResolvante.listeLitteraux.get(cptrLit)).predicat.equals("nl")){ System.out.println("\n"); if(copieResolvante.isEmpty()){ break; } copieResolvante.remove(0); } if(copieResolvante.toString().equals("fail")){ i++; break; } if(copieResolvante.toString().equals("!")){ //IR++; } if(copieResolvante.toString().equals("plus")){ if(((Clause.Litteral)(copieResolvante.get(0))).size()==3){ plus((Symbole)(((Clause.Litteral)(copieResolvante.get(0))).get(0)),(Symbole)(((Clause.Litteral)(copieResolvante.get(0))).get(1)),(Symbole)(((Clause.Litteral)(copieResolvante.get(0))).get(2)),l); } else{ System.out.println(false); } } }else{ if(display){ System.out.println("WE ARE TRYING TO UNIFY "+copieResolvante+" WITH "+courante+" IR: "+IR + ", i: "+i); } res = copieResolvante.unif(courante); if(res==null)continue; if (res.size()==0){ System.out.println("RESOLUTION ACHIEVED\n****************************************\n"); System.out.println("RESULT: here we want the result..........???" ); return; } if(res.size()>0){//succes unification Index[IR-1]=i+1; //IR++; unif = true; if(display){ System.out.println("RESOLUTION DONE\nGOAL:"+ res +"\n****************************************\n"); } if(display){ for(int k=0;k<=IR;k++)System.out.print(Clause.ListeClauses[k]+" / "); } //for(int ii=0;ii<=Prolog.IR;i++)System.out.print(Clause.ListeClauses[ii]+" / "); break; } } }//fin for

IR is the Resolution indice, the goal is copieResolvante, courante is each clause we are testing (and we want to test the from the bottom to the top).

Here is the whole code, the file has to be placed in static String file ="exercice4.pl"; with the name you will give him instead of exercice4.pl and placed at the root of the workspace.

Enough speaking. If you're willing to help me and I would be very grateful!!!

package projetMichel; // source.txt doit etre ds le rép. du projet // IMPORTANT: la derniere ligne doit être vide // IR compte les clauses et sert d'indice de resolution import java.io.*; import java.util.*; import projetMichel.Couples; import projetMichel.Symbole; public class ProjetMichel { static String file ="exercice4.pl"; static String[] Clauses= new String[120]; static int cptVar = 0; static int maxVar = 200; static String[] VarAffich; static Object[] VarVal; static int[] VarSubst; static Clause Resolvante; static int IR=-1; static int ICF; static List listeCode; static List listeSymbole; static List listeAff; static int code; static boolean display =true; static boolean result=false; static int varExiste(String n){ for(int i=0;i<listeAff.size();i++){ if( ((String)listeAff.get(i)).equals(n)) return i; } return -1; } public static void main(String[] args) { String chaine=""; VarAffich = new String[maxVar]; VarVal = new Object[maxVar]; VarSubst = new int[maxVar];String ligne=""; //file reading try{ InputStream ips=new FileInputStream(file); InputStreamReader ipsr=new InputStreamReader(ips); BufferedReader br=new BufferedReader(ipsr); Clauses = new String[100]; for(int i=0;i<100;i++)Clauses[i]=""; boolean suite; int i=0; while ((ligne=br.readLine())!=null){ suite = false; System.out.println(ligne); Clauses[i]+=ligne; if(ligne.charAt(ligne.length()-1)!='.') {Clauses[i]+=" ";continue;} i++; chaine+=ligne+"\n"; } br.close(); } catch (Exception e){ //System.out.println("Erreur "+ligne.charAt(ligne.length()-1)+e.toString()); } // Clause transformation and IR calculation int k = 0; while(!Clauses[k].equals("")){;ri(k);k++;} if(display){ System.out.println("SUITE IR "+IR); for(int i=0;i<=IR;i++)System.out.println("LISTE "+Clause.ListeClauses[i]); System.out.println("Debut RESOLUTION IR "+IR); } resolution(Clause.ListeClauses); if(display){ for(int i=0;i<=IR;i++)System.out.println("Liste "+Clause.ListeClauses[i]); } } static Clause ri(int noClause){ Clause c=new Clause(); String mot = ""; String mot_old = ""; List liste = new LinkedList(); Clause.Litteral lit = null; Clause.Litteral.Symbole s = null; boolean variables = false; boolean predicat = false; //AJOUT listeCode = new LinkedList(); listeSymbole = new LinkedList(); listeAff = new LinkedList(); do{ mot_old = mot; mot = parsingClause(noClause); if(mot.equals("(")||mot.equals("[")){ variables = true; lit = c.new Litteral(mot_old); c.add(lit); continue; } if(mot.equals(",")){ if(variables){ //System.out.println("symbole analyse "+mot_old); if(varExiste(mot_old)==-1){ //System.out.println(mot_old+" n'existe pas "+listeAff); code=Annuaire.Code++;// Annuaire.AffSymbole.put(code, mot_old); if(mot_old.charAt(0)>='A'&&mot_old.charAt(0)<='Z'){ Annuaire.ValSymbole.put(code, null); }else Annuaire.ValSymbole.put(code, mot_old); s = lit.new Symbole(mot_old); s.code = code; lit.add(s); listeCode.add(code); listeSymbole.add(s); listeAff.add(mot_old); } else{ //System.out.println(mot_old+" existe"+varExiste(mot_old)); lit.add(listeSymbole.get(varExiste(mot_old))); } } if(predicat){ predicat = false; c.add( c.new Litteral(mot_old)); } continue; } if(mot.equals(")")||mot.equals("]")){ variables = false; // verifying if a symbol does exist in the clause if(varExiste(mot_old)==-1){ //System.out.println(mot_old+" n'existe pas "+listeAff); code=Annuaire.Code++;// Annuaire.AffSymbole.put(code, mot_old); if(mot_old.charAt(0)>='A'&&mot_old.charAt(0)<='Z'){ Annuaire.ValSymbole.put(code, null); }else Annuaire.ValSymbole.put(code, mot_old); s = lit.new Symbole(mot_old); s.code = code; lit.add(s); listeCode.add(code); listeSymbole.add(s); listeAff.add(mot_old); } else{ //second cas: the bvariable has already been met //System.out.println(mot_old+" existe"+varExiste(mot_old)); lit.add(listeSymbole.get(varExiste(mot_old))); } continue; } else{// c'est un mot if(predicatConstant(mot)){predicat = true;} continue; } }while (!mot.equals("")); // case of a constant predicat at the end of a Clause if(predicat){c.add(c.new Litteral(mot_old));} //we have to change the variables name adding the name (only var) didn't understood this type actually //il faut changer le nom des variables en y incorporant le nom (var uniquement) for(int i=0;i<listeCode.size();i++){ if( Annuaire.val((Integer)listeCode.get(i))==null ) Annuaire.AffSymbole.put((Integer)listeCode.get(i),listeAff.get(i)+listeCode.get(i).toString()); } if(display){ System.out.println("CLAUSE "+c); } Clause.ListeClauses[++IR] = c; return c; } static boolean delimiteur(char c){ boolean b = false; if(c=='('||c==')'||c==','||c==':'||c=='['||c==']')b = true; return b; } static boolean predicatConstant(String p){ boolean b = false; if(p.equals("nl")||p.equals("fail")||p.equals("!")||p.equals("cut")) b = true; return b; } static boolean variable(Object s){ boolean b = false; String ch; if(s instanceof String){ ch = (String)s; if(ch.charAt(0)>='A'&&ch.charAt(0)<='Z')b = true; } if(s instanceof Integer){ return true; } return b; } static String parsingClause(int noClause){ String mot=""; //System.out.println("DEBUG "+Clauses[noClause].charAt(0)); while(Clauses[noClause].charAt(0)==' ')Clauses[noClause]=Clauses[noClause].substring(1); if(Clauses[noClause].charAt(0)=='.'){Clauses[noClause]=Clauses[noClause].substring(1);return mot;} if(Clauses[noClause].charAt(0)==':' && Clauses[noClause].charAt(1)=='-'){ Clauses[noClause]=Clauses[noClause].substring(2); return ":-"; } if(delimiteur(Clauses[noClause].charAt(0))){ String r= Character.toString(Clauses[noClause].charAt(0)); Clauses[noClause]=Clauses[noClause].substring(1); return r; } // word began is being read while(!delimiteur(Clauses[noClause].charAt(0))&&Clauses[noClause].charAt(0)!='.'&&Clauses[noClause].charAt(0)!=' '){ mot+=Character.toString(Clauses[noClause].charAt(0)); Clauses[noClause]=Clauses[noClause].substring(1); } return mot; } static void resolution(Clause[] lc){ if(display){ for(int i=0;i<=IR;i++)System.out.print(lc[i]+" / "); } boolean unif; List res; Resolvante = lc[IR];//(Clause)lc.get(lc.size()-1); ICF=IR; int[] Index = new int[100]; System.out.println("\nBEGINING !"); while(IR >= ICF){ unif = false; Clause copieResolvante = Clause.copie(IR); int cptrLit= 0; for(int i=Index[IR];i<IR;i++){ Clause courante = Clause.copie(i); Clause.Litteral l = (Clause.Litteral)copieResolvante.listeLitteraux.get(0); String enterChar = ((Clause.Litteral)copieResolvante.listeLitteraux.get(0)).predicat; if ( (enterChar.equals("write") || enterChar.equals("nl") || enterChar.equals("fail")||enterChar.equals("!"))||enterChar.equals("plus") && cptrLit <= copieResolvante.listeLitteraux.size()-1){ if(cptrLit > copieResolvante.listeLitteraux.size()- 1 ){ break; } while(((Clause.Litteral)copieResolvante.listeLitteraux.get(cptrLit)).predicat.equals("write")){ Clause.Litteral.Symbole s = (Clause.Litteral.Symbole)l.get(0); cptrLit++; //System (enterChar.equals("write") || enterChar.equals("nl") || enterChar.equals("fail")).out.println("copieResolvante : "+ copieResolvante.listeLitteraux.size()); if((cptrLit > copieResolvante.listeLitteraux.size()- 1 )||(copieResolvante.isEmpty())){ break; } l = (Clause.Litteral)copieResolvante.listeLitteraux.get(cptrLit);// why? System.out.println(s); //HERE WE TRIED TO DELETE THE WRITE AND NL copieResolvante.remove(0); if(display){ System.out.println("\n\nCOPIE RESOLVANTE: " + copieResolvante); } } if(cptrLit > copieResolvante.listeLitteraux.size()- 1 ){ break; } if(((Clause.Litteral)copieResolvante.listeLitteraux.get(cptrLit)).predicat.equals("nl")){ System.out.println("\n"); if(copieResolvante.isEmpty()){ break; } copieResolvante.remove(0); } if(copieResolvante.toString().equals("fail")){ i++; break; } if(copieResolvante.toString().equals("!")){ //IR++; } if(copieResolvante.toString().equals("plus")){ if(((Clause.Litteral)(copieResolvante.get(0))).size()==3){ plus((Symbole)(((Clause.Litteral)(copieResolvante.get(0))).get(0)),(Symbole)(((Clause.Litteral)(copieResolvante.get(0))).get(1)),(Symbole)(((Clause.Litteral)(copieResolvante.get(0))).get(2)),l); } else{ System.out.println(false); } } }else{ if(display){ System.out.println("WE ARE TRYING TO UNIFY "+copieResolvante+" WITH "+courante+" IR: "+IR + ", i: "+i); } res = copieResolvante.unif(courante); if(res==null)continue; if (res.size()==0){ System.out.println("RESOLUTION ACHIEVED\n****************************************\n"); System.out.println("RESULT: here we want the result..........???" ); return; } if(res.size()>0){//succes unification Index[IR-1]=i+1; //IR++; unif = true; if(display){ System.out.println("RESOLUTION DONE\nGOAL:"+ res +"\n****************************************\n"); } if(display){ for(int k=0;k<=IR;k++)System.out.print(Clause.ListeClauses[k]+" / "); } //for(int ii=0;ii<=Prolog.IR;i++)System.out.print(Clause.ListeClauses[ii]+" / "); break; } } }//fin for if(!unif)IR--; } if(result){ System.out.println("FAILURE ON THE PROGRAM !"); }else{ System.out.println("PROGRAM RESOLUTION DONE !"); } } private static void plus(projetMichel.Symbole x, projetMichel.Symbole y, projetMichel.Symbole z, Clause.Litteral l) { // TODO Auto-generated method stub if (isDouble(x.affI)){ if (isDouble(y.affI)){ if (isDouble(z.affI)) System.out.println(Double.parseDouble(z.affI)==Double.parseDouble(x.affI)+Double.parseDouble(y.affI)); else{ Integer b=Integer.parseInt(x.affI)+Integer.parseInt(y.affI); Symbole tmp2=new Symbole(b.toString(),b.toString()); l.add(new Couples(z,tmp2)); } } else if (isDouble(z.affI)){ Integer b=Integer.parseInt(z.affI)-Integer.parseInt(x.affI); Symbole tmp2=new Symbole(b.toString(),b.toString()); l.add(new Couples(y,tmp2)); } } else if(isDouble(y.affI) && isDouble(z.affI)){ Integer b=Integer.parseInt(z.affI)-Integer.parseInt(y.affI); Symbole tmp2=new Symbole(b.toString(),b.toString()); l.add(new Couples(x,tmp2)); } else System.out.println(false); } private static boolean isDouble(String affI) { // TODO Auto-generated method stub try { Double.parseDouble(affI); return true; } catch (NumberFormatException e) { return false; } } static class Annuaire{ static Map<Integer,Object> ValSymbole = new HashMap<Integer,Object>(); static Map<Integer,String> AffSymbole = new HashMap<Integer,String>(); static String aff(int c){return AffSymbole.get(c);} static Object val(int c){return ValSymbole.get(c);} static int Code=1; } static class Clause extends LinkedList{ boolean caseDisplay =false;// Why can't I declare it above? as a static argument? static Clause[] ListeClauses = new Clause[100]; List listeVar; List listeLitteraux; List listeCode; int varExiste(String n){ for(int i=0;i<listeVar.size();i++){ if( ((String)listeVar.get(i)).equals(n)) return i; } return 0; } Clause(){ super(); listeVar = new LinkedList(); listeCode = new LinkedList(); //System.out.println("creation clause"); listeLitteraux = new LinkedList();/*ListeClauses[IC++]=this;*/} public String toString(){String r= super.toString();return r.substring(1, r.length()-1);} boolean isDouble(String str) { try { Double.parseDouble(str); return true; } catch (NumberFormatException e) { return false; } } class Litteral extends LinkedList{ String predicat; List listeVar; @SuppressWarnings("rawtypes") Litteral(String p){ super(); predicat = p;listeVar = new LinkedList();listeLitteraux.add(this); //System.out.println("creation litteral "+predicat); } //public String toString(){return super.toString();} class Symbole{ int code; String aff; String affI; Object val; Symbole(String s){ } public String toString(){return Annuaire.aff(code);} Object getVal(){return null;} String getAff(){return affI;} boolean libre(){return true;} } public String toString(){ if(ProjetMichel.predicatConstant(predicat))return predicat; return predicat+super.toString(); } } static Clause copie(int i){ ProjetMichel.Clauses[99]=Clause.ListeClauses[i].toString()+"."; Clause c = ProjetMichel.ri(99); //we have to suppress the variable added to listeClause[] //il faut retirer la clause ajouté à listeClauses[] ProjetMichel.IR--; return c; } List unif(Clause c){ Clause res = new Clause(); Clause.Litteral l1 = (Clause.Litteral)get(0); Clause.Litteral l2 =(Clause.Litteral)c.get(0); if(!l1.predicat.equals(l2.predicat))return null; for(int i=0;i<l1.size();i++){ Clause.Litteral.Symbole s1 = (Clause.Litteral.Symbole)l1.get(i); Clause.Litteral.Symbole s2 = (Clause.Litteral.Symbole)l2.get(i); if(caseDisplay){ System.out.println("CASE "+s1+" "+s2); } //case var/cste if(Annuaire.val(s1.code)==null && Annuaire.val(s2.code)!=null){ if(caseDisplay){ System.out.println("var/cste"); System.out.println("UNIFICATION BETWEEN "+this+" AND "+c); } Annuaire.ValSymbole.put(s1.code, Annuaire.val(s2.code)); Annuaire.AffSymbole.put(s1.code, Annuaire.aff(s2.code)); continue; } //case cste/var if(Annuaire.val(s2.code)==null && Annuaire.val(s1.code)!=null){ if(caseDisplay){ System.out.println("cste/var"); System.out.println("UNIFICATION BETWEEN "+this+" AND "+c); } Annuaire.ValSymbole.put(s2.code, Annuaire.val(s1.code)); Annuaire.AffSymbole.put(s2.code, Annuaire.aff(s1.code)); continue; } //case cste/cste if((Annuaire.val(s1.code)!=null && Annuaire.val(s2.code)!=null)&&(s1.toString().equals(s2.toString()))){ if(caseDisplay){ System.out.println("Constant - Constant with s1 == s2 " + s1 + " " + s2); } //should we write false? it would end the array decomposition } if((Annuaire.val(s1.code)!=null && Annuaire.val(s2.code)!=null)&&(!(s1.toString().equals(s2.toString())))){ if(caseDisplay){ System.out.println("s1: "+ s1); System.out.println("s2: "+ s2); System.out.println("Constant - Constant with s1 != s2 " + s1 + " " + s2); } //should we write false? it would end the array decomposition break; } //case var/var if(Annuaire.val(s1.code)==null && Annuaire.val(s2.code)==null){ if(caseDisplay){ System.out.println("Variable - Variable"); System.out.println("VERIF "+s2.code+" "+s1.toString()+ " "+Annuaire.val(s1.code)); System.out.println("UNIFICATION BETWEEN "+this+" AND "+c);// traiter le null. } Annuaire.AffSymbole.put(s2.code, s1.toString()); //Annuaire.ValSymbole.put(s2.code, Annuaire.val(s1.code).toString());// Doesn't change??? //java.lang.NullPointerException } } Clause nc = new Clause(); for(int i=1;i<c.size();i++)nc.add(c.get(i)); for(int i=1;i<size();i++)nc.add(get(i)); ListeClauses[++ProjetMichel.IR] = nc; return nc; } } }

Two other files are associated: the class Couples...

package projetMichel; import projetMichel.ProjetMichel.Clause; public class Couples { Symbole a; Symbole b; Couples(Symbole y,Symbole b){ this.a=y;this.b=b; } Couples() { } public String toString(){ return "("+a+","+b+")"; } }

And the class Symbol

package projetMichel; import projetMichel.Symbole; public class Symbole{ String aff; String affI; Object val; Object valI; Object getVal(){return val;} String getAff(){return aff;} Boolean libre(){return val==null;} Symbole(String s){ aff=s; affI=s; val=null; valI=null; } Symbole(String s1,String s2){ aff=s1; affI=s1; val=s2; valI=s2; } public String toString(){ return aff; } public boolean equals(Symbole a){ return aff.equals(a.aff); } public boolean equals(Object o){ return ((String)o).equals(affI); } }

I still have to create a manager GUI interface in order to make this thing user friendly.