Yakoub Salhi

According to our database1, Yakoub Salhi
  • authored at least 50 papers between 2008 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Studying the use and effect of graph decomposition in qualitative spatial and temporal reasoning.
Knowledge Eng. Review, 2017

On an MCS-based inconsistency measure.
Int. J. Approx. Reasoning, 2017

Mining Top-k motifs with a SAT-based framework.
Artif. Intell., 2017

Clustering Complex Data Represented as Propositional Formulas.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2017

Enumerating Non-redundant Association Rules Using Satisfiability.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2017

From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes.
Proceedings of the LPAR-21, 2017

Enhancing Pigeon-Hole based Encoding of Boolean Cardinality Constraints.
Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017

2016
Optimization in temporal qualitative constraint networks.
Acta Inf., 2016

A MIS Partition Based Framework for Measuring Inconsistency.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Quantifying Conflicts for Spatial and Temporal Information.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

A SAT-Based Approach for Mining Association Rules.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Itemset Mining with Penalties.
Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

On the Computation of Top-k Extensions in Abstract Argumentation Frameworks.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015
On SAT Models Enumeration in Itemset Mining.
CoRR, 2015

Generalized Qualitative Spatio-Temporal Reasoning: Complexity and Tableau Method.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2015

On the use and effect of graph decomposition in qualitative spatial and temporal reasoning.
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015

Decomposition Based SAT Encodings for Itemset Mining Problems.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2015

Ordering Spatio-Temporal Sequences to Meet Transition Constraints: Complexity and Framework.
Proceedings of the Artificial Intelligence Applications and Innovations, 2015

Mining to Compress Table Constraints.
Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

A Resolution Method for Modal Logic S5.
Proceedings of the Global Conference on Artificial Intelligence, 2015

A Simple Decomposition Scheme for Large Real World Qualitative Constraint Networks.
Proceedings of the Twenty-Eighth International Florida Artificial Intelligence Research Society Conference, 2015

On Measuring Inconsistency Using Maximal Consistent Sets.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2015

On Structure-Based Inconsistency Measures and Their Computations via Closed Set Packing.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Parallel SAT based closed frequent itemsets enumeration.
Proceedings of the 12th IEEE/ACS International Conference of Computer Systems and Applications, 2015

2014
On the measure of conflicts: A MUS-Decomposition Based Framework.
CoRR, 2014

Revisiting the Learned Clauses Database Reduction Strategies.
CoRR, 2014

Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

A Pigeon-Hole Based Encoding of Cardinality Constraints.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Extending modern SAT solvers for models enumeration.
Proceedings of the 15th IEEE International Conference on Information Reuse and Integration, 2014

A Generic and Declarative Method for Symmetry Breaking in Itemset Mining.
Proceedings of the Knowledge Discovery, Knowledge Engineering and Knowledge Management, 2014

Symmetry Breaking in Itemset Mining.
Proceedings of the KDIR 2014 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, Rome, Italy, 21, 2014

Symétries et Extraction de Motifs Ensemblistes.
Proceedings of the 14èmes Journées Francophones Extraction et Gestion des Connaissances, 2014

A Qualitative Spatio-Temporal Framework Based on Point Algebra.
Proceedings of the Artificial Intelligence: Methodology, Systems, and Applications, 2014

A Constructive Argumentation Framework.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
A Pigeon-Hole Based Encoding of Cardinality Constraints.
TPLP, 2013

A Mining-Based Compression Approach for Constraint Satisfaction Problems
CoRR, 2013

Mining to Compact CNF Propositional Formulae
CoRR, 2013

The Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Symmetry-Based Pruning in Itemset Mining.
Proceedings of the 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, 2013

Mining-based compression approach of propositional formulae.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

Boolean satisfiability for sequence mining.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012
Graded Modal Logic GS5 and Itemset Support Satisfiability.
Proceedings of the Information Search, Integration and Personalization, 2012

Symmetries in Itemset Mining.
Proceedings of the ECAI 2012, 2012

A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence.
Proceedings of the ECAI 2012, 2012

2011
Sequent calculi and decidability for intuitionistic hybrid logic.
Inf. Comput., 2011

2010
Structures Multi-contextuelles et Logiques Modales Intuitionnistes et Hybrides. (Multi-contextual Structures and Intuitionistic and Hybrid modal logics).
PhD thesis, 2010

A family of Gödel hybrid logics.
J. Applied Logic, 2010

Label-free natural deduction systems for intuitionistic and classical modal logics.
Journal of Applied Non-Classical Logics, 2010

Label-Free Proof Systems for Intuitionistic Modal Logic IS5.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2008
Labelled Calculi for Lukasiewicz Logics.
Proceedings of the Logic, 2008


  Loading...