10

International journals articles

1

International conferences articles

1

Conference articles without published proceedings

1

Thesis and HDR

International journals articles

Zainab Assaghir, Antoun Yaacoub, Sara Makki Network intrusion detection demystified using classification trees. In : International Journal on Recent and Innovation Trends in Computing and Communication., Vol. 5 Issue.: 1 pp. 317-1320 (2017).

Access : http://www.ijritcc.org/download/browse/Volume_5_Issues/January_17_Volume_5_Issue_1/1486362271_06-02-2017.pdf

Abstract

In a network environment, intrusions pose a serious security problem especially when new intrusion types are discovered which make them difficult to detect. In this work, we use the Classification And Regression Tree (CART) algorithm, a supervised learning technique, on a labeled dataset collected during an attack on the Faculty of Science's web servers, and this in order to classify bad and good connections. As result, the accuracy of the classification reached 99%, maintaining low falsenegative and low false-positive rates.

Antoun Yaacoub, Zainab Assaghir Bottom-Up Bisimilar Datalog Goals. In : American Journal of Engineering Research., Vol. 6 Issue.: 1 pp. 140-147 (2017).

Access : http://www.ajer.org/papers/v6(01)/V0601140147.pdf

Abstract

We introduce the concept of bisimulation between Datalog goals using bottom-up evaluation technique: two Datalog goals are bisimilar with respect to a given Datalog program equipped with a bottom-up evaluation technique when their resolution trees are bisimilar. We define the notion of a resolution tree and we address the problem of deciding whether two given goals are bisimilar with respect to given programs. When the given program is a Datalog program equipped with a bottom-up evaluation technique, this problem is decidable in 2EXPTIME.

Antoun Yaacoub, Hassan Safwan On the decidability of the information flow in Datalog using Magic Sets. In : International Journal of Scientific Development and Research., Vol. 2 Issue.: 1 pp. 19-27 (2017).

Access : http://www.ijsdr.org/papers/IJSDR1701005.pdf

Abstract

Information flow in logic programming was recently defined using the bottom-up evaluation approach. In this paper, we tackle the same question using the Magic Sets bottom-up evaluation approach. We will show, using this technique that the existence of the information flow is decidable. Finally, we will study the computational complexity of the decidability of the existence of the flow and prove that it is EXPTIME-complete.

Antoun Yaacoub Bisimilarity, Datalog And Negation. In : International Journal of Computer Science: Theory and Application (IJCSTA)., Vol. 5 Issue.: 2 pp. 28-34 (2016).

Access : http://www.orb-academic.org/index.php/journal-of-computer-science/article/download/256/91

Abstract

We extend the concept of bisimilarity relation between datalog 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 soundness and completeness results. We address the problem of deciding whether two given goals are bisimilar with respect to a given program. 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. In : International Journal of Computer Science: Theory and Application (IJCSTA)., Vol. 5 Issue.: 2 pp. 35-48 (2016).

Access : http://www.orb-academic.org/index.php/journal-of-computer-science/article/download/255/90

Abstract

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 Inference Control On Information Flow In Logic Programming. In : International Journal of Computer Science: Theory and Application (IJCSTA), Vol. 3 Issue.: 1 pp. 13-22 (2015).

Access : http://www.orb-academic.org/index.php/journal-of-computer-science/article/download/47/44

Abstract

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, Ali Awada, Habib Kobeissi Information Flow in Concurrent Logic Programming. In : British Journal of Mathematics and Computer Science, Vol. 5 Issue.: 3 pp. 367-382 (2015).

Access : http://www.sciencedomain.org/download.php?f=Ali532014BJMCS14398_1.pdf&aid=6882&type=a

Abstract

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 Towards an information flow in logic programming. In : International Journal of Computer Science Issues, Vol. 9 No. 2 pp. 52-60 (2012).

Access : http://ijcsi.org/papers/IJCSI-9-2-1-52-60.pdf

Abstract

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.

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

Access : http://cisjournal.org/archive/vol2no5/vol2no5_1.pdf

Abstract

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. In : International Journal of Computer Science and Network Security, Vol. 10 No. 6 pp. 71-79 (2010).

Access : http://paper.ijcsns.org/07_book/201006/20100610.pdf

Abstract

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.

International conferences articles

Philippe Balbiani, Antoun Yaacoub Deciding the bisimilarity relation between Datalog goals (regular paper). In : 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.
Abstract

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.

Conference articles without published proceedings

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

Access : http://gdri3iaf.info.univ-angers.fr/IMG/pdf/awada-balbiani-yaacoub.pdf

Abstract

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.

Thesis and HDR

Antoun Yaacoub. Information flow in logic programming. Thèse de doctorat, Université Paul Sabatier, novembre 2012.

Access : ftp://ftp.irit.fr/IRIT/LILAC/Theses_et_habilitations/2012_Yaacoub_PhD.pdf

Abstract

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.