EXECUTION TRACES COMPREHENSION IS AN IMPORTANT TOPIC IN COMPUTER SCIENCE SINCE IT ALLOWS SOFTWARE ENGINEERS TO GET A BETTER UNDERSTANDING OF THE SYSTEM BEHAVIOR. HOWEVER, TRACES ARE USUALLY VERY LARGE AND HENCE THEY ARE DIFFICULT TO INTERPRET. PARALLEL, EXECUTION TRACES COMPREHENSION IS A VERY IMPORTANT TOPIC INTO THE ALGORITHMS LEARNING COURSES SINCE IT ALLOWS STUDENTS TO GET A BETTER UNDERSTANDING OF THE ALGORITHM BEHAVIOR. THEREFORE, THERE IS A NEED TO INVESTIGATE WAYS TO HELP STUDENTS (AND TEACHERS) FIND AND UNDERSTAND IMPORTANT INFORMATION CONVEYED IN A TRACE DESPITE THE TRACE BEING MASSIVE. IN THIS PAPER, WE PROPOSE A NEW APPROXIMATION FOR EXECUTION TRACES COMPREHENSION BASED ON FUZZY LINGUISTIC DESCRIPTIONS. A NEW METHODOLOGY AND A DATA-DRIVEN ARCHITECTURE BASED ON LINGUISTIC MODELLING OF COMPLEX PHENOMENON ARE PRESENTED AND EXPLAINED. IN PARTICULAR, THEY ARE APPLIED TO AUTOMATICALLY GENERATE LINGUISTIC REPORTS FROM EXECUTION TRACES GENERATED DURING THE EXECUTION OF ALGORITHM IMPLEMENTED BY THE STUDENTS OF AN INTRODUCTORY COURSE OF ARTIFICIAL INTELLIGENCE. TO THE BEST OF OUR KNOWLEDGE, IT IS THE FIRST TIME THAT LINGUISTIC MODELLING OF COMPLEX PHENOMENON IS APPLIED TO EXECUTION TRACES COMPREHENSION. THROUGHOUT THE ARTICLE, IT IS SHOWN HOW THIS KIND OF TECHNOLOGY CAN BE EMPLOYED AS A USEFUL COMPUTER-ASSISTED ASSESSMENT TOOL THAT PROVIDES STUDENTS AND TEACHERS WITH TECHNICAL, IMMEDIATE AND PERSONALISED FEEDBACK ABOUT THE ALGORITHMS THAT ARE BEING STUDIED AND IMPLEMENTED. AT THE SAME TIME, THEY PROVIDE US WITH TWO USEFUL APPLICATIONS: THEY ARE AN INDISPENSABLE PEDAGOGICAL RESOURCE FOR IMPROVING COMPREHENSION OF EXECUTION TRACES, AND THEY PLAY AN IMPORTANT ROLE IN THE PROCESS OF MEASURING AND EVALUATING THE ?BELIEVABILITY? OF THE AGENTS IMPLEMENTED. TO SHOW AND EXPLORE THE POSSIBILITIES OF THIS NEW TECHNOLOGY, A WEB PLATFORM HAS BEEN DESIGNED AND IMPLEMENTED BY ONE OF THE AUTHORS, AND IT HAS BEEN INCORPORATED INTO THE PROCESS OF ASSESSMENT OF AN INTRODUCTORY ARTIF

THIS PAPER AIMS TO PROPOSE A NEW VERSION OF THE TURING TEST FOR COMPUTER GAME BOTS BASED ON LINGUISTIC DESCRIPTION OF COMPLEX PHENOMENA AND RESTRICTED EQUIVALENCE FUNCTIONS WHOSE GOAL IS TO EVALUATE THE """"BELIEVABILITY"""" OF THE COMPUTER GAMES BOTS ACTING IN A VIRTUAL WORLD. A DATA-DRIVEN SOFTWARE ARCHITECTURE BASED ON LINGUISTIC MODELLING OF COMPLEX PHENOMENA IS ALSO PROPOSED WHICH ALLOWS US TO AUTOMATICALLY GENERATE BOTS BEHAVIOR PROFILES WHICH CAN BE COMPARED WITH HUMAN PLAYERS BEHAVIOR PROFILES IN ORDER TO PROVIDE US WITH A SIMILARITY MEASURE OF BELIEVABILITY BETWEEN THEM.