Lhouari Nourine

Orcid: 0000-0003-0195-4132

According to our database1, Lhouari Nourine authored at least 74 papers between 1994 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Lattice point of view for argumentation framework.
Ann. Math. Artif. Intell., October, 2023

Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements.
Theor. Comput. Sci., August, 2023

Representations for the Largest Extension of a Closure System.
Order, April, 2023

On the preferred extensions of argumentation frameworks: Bijections with naive sets.
Inf. Process. Lett., March, 2023

2022
The enumeration of meet-irreducible elements based on hierarchical decompositions of implicational bases.
CoRR, 2022

On the preferred extensions of argumentation frameworks: bijections with naive extensions.
CoRR, 2022

2021
Translating between the representations of a ranked convex geometry.
Discret. Math., 2021

On the dualization in distributive lattices and related problems.
Discret. Appl. Math., 2021

Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline Groups.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Enumerating Maximal Consistent Closed Sets in Closure Systems.
Proceedings of the Formal Concept Analysis - 16th International Conference, 2021

2020
Dualization in lattices given by implicational bases.
Theor. Comput. Sci., 2020

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets.
CoRR, 2020

Hierarchical Decompositions of Dihypergraphs.
Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

Dihypergraph Decomposition: Application to Closure System Representations.
Proceedings of the 8th International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI 2020) co-located with 24th European Conference on Artificial Intelligence (ECAI 2020), 2020

2019
WEPA 2016 preface.
Discret. Appl. Math., 2019

Possible/Certain Functional Dependencies.
CoRR, 2019

Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P<sub>7</sub>-Free and P<sub>8</sub>-Free Chordal Graphs.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Complexity of Conjunctive Regular Path Query Homomorphisms.
Proceedings of the Computing with Foresight and Industry, 2019

2018
Complexity Aspects of Web Services Composition.
Trans. Petri Nets Other Model. Concurr., 2018

Algorithms for computing the Shapley value of cooperative games on lattices.
Discret. Appl. Math., 2018

Representation of lattices via set-colored posets.
Discret. Appl. Math., 2018

Neighborhood preferences for minimal dominating sets enumeration.
CoRR, 2018

2017
Algorithms for k-meet-semidistributive lattices.
Theor. Comput. Sci., 2017

2016
Beyond Hypergraph Dualization.
Encyclopedia of Algorithms, 2016

Minimal Dominating Set Enumeration.
Encyclopedia of Algorithms, 2016

Extended dualization: Application to maximal pattern mining.
Theor. Comput. Sci., 2016

Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs.
SIAM J. Discret. Math., 2016

Preface.
RAIRO Oper. Res., 2016

Decidability and Complexity of Web Service Business Protocol Synthesis.
Int. J. Cooperative Inf. Syst., 2016

Discovering Injective Mapping Between Relations in Astrophysics Databases.
Proceedings of the Information Search, Integration, and Personlization, 2016

Partial Duplication of Convex Sets in Lattices.
Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications, 2016

2015
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Reasoning in description logics with variables: preliminary results regarding the EL logic.
Proceedings of the 28th International Workshop on Description Logics, 2015

Partial Enumeration of Minimal Transversals of a Hypergraph.
Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications, 2015

2014
On the Enumeration of Minimal Dominating Sets and Related Notions.
SIAM J. Discret. Math., 2014

Dualization on Partially Ordered Sets: Preliminary Results.
Proceedings of the Information Search, Integration and Personalization, 2014

Decidability and Complexity of Simulation Preorder for Data-Centric Web Services.
Proceedings of the Service-Oriented Computing - 12th International Conference, 2014

A One-pass Triclustering Approach: Is There any Room for Big Data?
Proceedings of the Eleventh International Conference on Concept Lattices and Their Applications, 2014

2013
A parameterizable enumeration algorithm for sequence mining.
Theor. Comput. Sci., 2013

On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Computing Implications with Negation from a Formal Context.
Fundam. Informaticae, 2012

Formal Approaches for Synthesis of Web Service Business Protocols.
Proceedings of the Web Services and Formal Methods - 9th International Workshop, 2012

On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Extending Set-based Dualization: Application to Pattern Mining.
Proceedings of the ECAI 2012, 2012

The Lattice of all Betweenness Relations: Structure and Properties.
Proceedings of The Ninth International Conference on Concept Lattices and Their Applications, 2012

On Decidability of Simulation in Data-Centeric Business Protocols.
Proceedings of the Business Process Management Workshops, 2012

2011
Enumeration of Minimal Dominating Sets and Variants.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Difficultés de résolution de problèmes.
Proceedings of the Third International Conference on Computer Science and its Applications (CIIA'11), 2011

2010
Conditional Functional Dependencies: An FCA Point of View.
Proceedings of the Formal Concept Analysis, 8th International Conference, 2010

About the Enumeration Algorithms of Closed Sets.
Proceedings of the Formal Concept Analysis, 8th International Conference, 2010

An Inference System for Exhaustive Generation of Mixed and Purely Negative Implications from Purely Positive Ones.
Proceedings of the 7th International Conference on Concept Lattices and Their Applications, 2010

2009
Representing lattices using many-valued relations.
Inf. Sci., 2009

Enumeration aspects of maximal cliques and bicliques.
Discret. Appl. Math., 2009

A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules.
Proceedings of the Formal Concept Analysis, 7th International Conference, 2009

2008
Web services composition is decidable.
Proceedings of the 11th International Workshop on the Web and Databases, 2008

Protocol-Based Web Service Composition.
Proceedings of the Service-Oriented Computing, 2008

Generating Positive and Negative Exact Rules Using Formal Concept Analysis: Problems and Solutions.
Proceedings of the Formal Concept Analysis, 6th International Conference, 2008

About Keys of Formal Context and Conformal Hypergraph.
Proceedings of the Formal Concept Analysis, 6th International Conference, 2008

2006
Minimum implicational basis for meet-semidistributive lattices.
Inf. Process. Lett., 2006

Interactive Association Rules Discovery.
Proceedings of the Formal Concept Analysis, 4th International Conference, 2006

About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base.
Proceedings of the Formal Concept Analysis, 4th International Conference, 2006

2005
The number of Moore families on <i>n</i>=6.
Discret. Math., 2005

Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases.
Proceedings of the Formal Concept Analysis, Third International Conference, 2005

2004
Computational aspects of the 2-dimension of partially ordered sets.
Theor. Comput. Sci., 2004

2002
A fast incremental algorithm for building lattices.
J. Exp. Theor. Artif. Intell., 2002

2001
Efficient algorithms on distributive lattices.
Discret. Appl. Math., 2001

1999
A Fast Algorithm for Building Lattices.
Inf. Process. Lett., 1999

Encoding of Multiple Inheritance Hierarchies and Partial Orders.
Comput. Intell., 1999

1997
Drawing and Encoding Two-Dimensional Posets.
Theor. Comput. Sci., 1997

Gray Codes for the Ideals of Interval Orders.
J. Algorithms, 1997

1996
Tree Structure for Distributive Lattices and its Applications.
Theor. Comput. Sci., 1996

1995
Linear Space Algorithm for On-line Detection of Global Predicates.
Proceedings of the International Workshop on Structures in Concurrency Theory, 1995

1994
Bit-Vector Encoding for Partially Ordered Sets.
Proceedings of the Orders, 1994


  Loading...