Login

Antoun Jacques Yaacoub

Associate professor
Computer Science - Statistics department - Section I - Hadath
Speciality: Computer Science
Specific Speciality: Artificial Intelligence
Interests: Cooking, astronomy, exploring countries, US series, latin music.
Skills: • An experienced project manager and team leader with the ability to initiate and manage multi-disciplinary projects and thus cross-functional teams.
• Decision making, critical thinking, organizing and planning. Initiative with a high level of energy.
• Self motivated, planed and organized.
• Critical thinking, decision-making and problem solving skills.
• Strong verbal and excellent personal communication skills.
• Project management skills: influencing, leading, negotiating and delegating abilities.
• Adaptability: tolerant and flexible to different stressed situations.

Positions
2015 - present : Associate Professor

Lebanese University - Faculty of Sciences - Section 1
Rafic Hariri University Campus - Hadath

2014 - present : IT head chief

Lebanese University - Faculty of Sciences - Dean's Office
Rafic Hariri University Campus - Hadath

2014 - present : Cultural Service head chief

Lebanese University - Faculty of Sciences - Dean's Office
Rafic Hariri University Campus - Hadath

2013 - 2015 : Assistant Professor

Lebanese University - Faculty of Sciences - Section 1
Rafic Hariri University Campus - Hadath

2011 - 2014 : Assistant

Lebanese University - Faculty of Sciences - Dean's Office
Rafic Hariri University Campus - Hadath

2008 - 2014 : Project Manager and Data Analyst

Middle East Studies ltd
Presidential Palace Road - Baabda

Teaching 9 Taught Courses
(2015-2016) I1100 - Introduction à l'Informatique (for MISPCE students)

BS MISPCE (M: Mathematics, I: Computer Science, S: Statistics, P: Physics, C: Chemistry, E: Electronics)

(2015-2016) Info 408 - Programming of Distributed Application

M1 Computer Sciences

(2015-2016) Info 409 - Advanced databases

M1 Computer Sciences

(2015-2016) Info 441 - Knowledge representation

M1 Computer Sciences

(2015-2016) Info 205 - Data structures

BS Computer Sciences

(2014-2015) Info 408 - Programming of Distributed Application

M1 Computer Sciences

(2014-2015) Info 441 - Knowledge representation

M1 Computer Sciences

(2014-2015) Info 205 - Data structures

BS Computer Sciences

(2014-2015) Info 210 - Introduction to Logic and Logic Programming

BS Computer Sciences

Publications 10 publications
Antoun Yaacoub Bisimilarity, Datalog And Negation International Journal of Computer Science: Theory and Application 2016

We extend the concept of bisimilarity relation between goals from positive datalog programs to stratified and restricted Datalog programs with negation. The introduction of negation forced us to reconsider the search space and the semantics in order to guarantee and preserve the soundness and completeness results. We address the problem of deciding whether two given goals are bisimilar with respect to given programs. When the given programs are stratified or restricted with negation, this problem is decidable.

Antoun Yaacoub, Ali Awada Information Flow In Datalog Using Very Naive And Semi Naive Bottom-Up Evaluation Techiques International Journal of Computer Science: Theory and Application 2016

Information flow in logic programming is well defined using the usual top-down evaluation approach. In this paper, we tackle the same question using a buttom up evaluation approach using two algorithms, Very Naive and Semi Naive algorithms. We will show that, using these techniques, the existence of the information flow is decidable, so that the flow of information can be detected in all cases. Finally, we will study the computational complexities of each decision problem and prove that it's EXPTIME-complete.

Antoun Yaacoub, Ali Awada, Habib Kobeissi Information Flow in Concurrent Logic Programming. British Journal of Mathematics and Computer Science, Vol. 5 No. 3 pp. 367-382 2015

This paper presents a new formalization of information flow detection in concurrent logic programming and applies it to the problem of deadlock detection. This work is based on a recent study of the detection of information flow in Datalog programs. Firstly, we define the concept of information flow in concurrent logic programming. Then, we propose a set of definitions of flow based on observation and transition systems while solving goals. Finally, we formalize a mechanism for deadlock detection in concurrent logic programs.

Antoun Yaacoub, Ali Awada. Inference Control on Information Flow in Logic Programming International Journal of Computer Science: Theory and Application 2015

This paper proposes a formal representation of inference control on information flow theory in logic programming. In order to control the fact that the result returned by a query can convey confidential information, we propose the notion of indistinguishability of flow and elaborate definitions of protection mechanisms, secure mechanisms, precise mechanisms and confidentiality policies based on this notion. We give a secure and precise protection mechanism that prohibits any undesirable inferences and minimizes the number of denials of legitimate actions.

Antoun Yaacoub Towards an information flow in logic programming. International Journal of Computer Science Issues Vol. 9 No. 2 pp. 52-60 2012

This paper proposes a theoretical foundation of what could be an information flow in logic programming. Several information flow definitions (based on success/failure, substitution answers, bisimulation between goals) are stated and compared. Decision procedures are given for each definition and complexity is studied for specific classes of logic programs.

Philippe Balbiani, Antoun Yaacoub Deciding the bisimilarity relation between Datalog goals. European Conference on Logics in Artificial Intelligence (JELIA 2012), Toulouse, 26/09/2012-28/09/2012, Luis Fariñas del Cerro, Andreas Herzig, Jérôme Mengin (Eds.), Springer, p. 67-79, septembre 2012. 2012

This paper proposes a theoretical foundation of what could be an information flow in logic programming. Several information flow definitions (based on success/failure, substitution answers, bisimulation between goals) are stated and compared. Decision procedures are given for each definition and complexity is studied for specific classes of logic programs.

Antoun Yaacoub Information flow in logic programming Université Paul Sabatier, Toulouse, France. 2012

This thesis is developed in order to tackle the issue of information flow in logic programming. The contributions of this thesis can be split into three mains parts:
1* Information flow in logic programming: we propose a theoretical foundation of what could be an information flow in logic programming. Several information flow definitions (based on success/failure, substitution answers, bisimulation between resolution trees of goals) are stated and compared. Decision procedures are given for each definition and complexity is studied for specific classes of logic programs.
2* Bisimulation of logic goals: We introduce the concept of bisimulation between Datalog goals: two Datalog goals are bisimilar with respect to a given Datalog program when their SLD-trees, considered as relational structures, are bisimilar. We address the problem of deciding whether two given goals are bisimilar with respect to given programs. When the given programs are hierarchical or restricted, this problem is decidable in 2EXPTIME.
3* Preventive inference control for deductive databases: We propose a secure and a precise security mechanism for deductive databases based on the notion of information flow in logic programming.

Ali Awada, Philippe Balbiani, Antoun Yaacoub Information flow in logic programming. ournées d’Intelligence Artificielle Fondamentale, Lyon, 08/06/2011- 10/06/2011 2011

This paper proposes a theoretical foundation of what could be an information flow in logic programming. Several information flow definitions (based on success/failure, substitution answers, bisimulation between resolution trees of goals) are stated and compared. Decision procedures are given for each definition and complexity is studied for specific classes of logic programs.

Ali Awada, May Dehayni, Antoun Yaacoub An ATMS-Based Tool for Locating Honor Cards in Rubber Bridge. Journal of Emerging Trends in Computing and Information Sciences Vol. 2 No. 5 pp. 209-218. 2011

This paper deals with the problem of providing assistance to a Bridge player using Artificial Intelligence techniques. In order to achieve this goal, we propose an approach that consists in making assumptions about the honor cards location, then to gradually eliminating the inconsistent assumptions until locating all honor cards. Based on the bids, assumptions about honor cards distribution are made using abduction reasoning. The consistency of these assumptions is managed by an Assumption-based Truth Maintenance System (ATMS). As the game progresses, playing a card generates facts, thereby invalidating some assumptions that cause contradiction and transforming some others into facts corresponding to the location of honor cards.

Antoun Yaacoub, Ali Awada, May Dehayni Visualizing relationships in Hierarchical Small World Networks. International Journal of Computer Science and Network Security Vol. 10 No. 6 pp. 71-79 2011

This research provides a method for studying and visualizing different types of relationships in various worlds such as dictionaries and Web pages. As a first step, we identify different types of relationships between objects of the universes previously mentioned. The second step consists in developing a method to quantify the relationship to study. The constituents of the universe (Web pages, items associated with entries in a dictionary ...) form a HSWN graph (hierarchical small world network) whose nodes are entities and edges reflect a direct link (hypertext, definitional ...) between two nodes. This leads to introduce a method for studying the structure of large graphs of hierarchical small world type. Our approach is based on the use of Markovian matrices. A matrix is multiplied k times in order to quantify the relationship between all the nodes of the graph. To illustrate this approach, examples and results on Web and linguistic graphs are given.

Supervision 5 Supervised Students
Detection and Removal of shadows in images

Ali Fayez Chaib
Master M2 Thesis: Computer Science and Telecommunication in 2015

Information flow detection in concurrent logic programming.

Zeinab Mokdad
Master thesis in computer science, Lebanese University, February - July 2013.
Co-tutoring with Ali Awada.

In this master thesis, we are interested in detecting the flow of information in concurrent logic programming and applying these concepts in order to detect deadlocks in concurrent logic programs. This work is based on a recent study on the detection of flow of information in the first order logic programming. Our aim is to define the concept of flow of information in concurrent logic programming. For this, we will propose several definitions based firstly on what we can observe when “resolving” a goal in concurrent logic programming, namely, the set of goals / that succeed / that fail / leading to a blocking state / leading to an infinite state. Then, we will propose other definitions based on the set of transitions in concurrent logic programming to finally propose a final set of definitions based on the number of transitions while solving goals. We then study the relationship between the different definitions. Finally, we use these definitions to formalize and implement a mechanism for deadlock detection in concurrent programs.

Emotion expression and recognition.

Hassan Assaad
Master thesis in computer science, Lebanese University, since march 2014.
Co-tutoring with Ali Awada.

Information flow in Datalog using bottom-up evaluation.

Hassan Safwan
Master thesis in computer science, Lebanese University, since february 2014.
Co-tutoring with Ali Awada.

This thesis is developed in order to outline the issues of information flow in logic programming. At first, we will highlight on what previously has been done in the field of information flow in imperative and logic programming based on top down evaluation.
Our contribution is based on bottom up evaluation using three algorithms, Very Naive, Semi Naive and Magic Sets algorithms. We will show that, using these techniques, the existence of the information

Complex emotions expression and recognition in anthropomorphic systems.

Mohamad Ab Saleh
Ph.D. thesis in computer science, Lebanese University, since january 2014.
Co-tutoring with Ali Awada.

Languages
Arabic

Native or bilingual proficiency

Armenian

Native or bilingual proficiency

English

Full professional proficiency

French

Full professional proficiency

Spanish

Limited working proficiency