default search action
Yakoub Salhi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Yakoub Salhi, Michael Sioutis
:
On prime scenarios in qualitative spatial and temporal reasoning. Inf. Comput. 300: 105198 (2024) - [c60]Abderrahmane Boukontar, Jean-François Condotta, Yakoub Salhi:
On Clustering in Qualitative Spatial and Temporal Reasoning. FLAIRS 2024 - [c59]Jean-François Condotta, Yakoub Salhi:
A Framework for Assessing Inconsistency in Disjunctive Temporal Problems. TIME 2024: 15:1-15:18 - 2023
- [c58]Yakoub Salhi, Michael Sioutis:
A Paraconsistency Framework for Inconsistency Handling in Qualitative Spatial and Temporal Reasoning. ECAI 2023: 2049-2056 - [c57]Yakoub Salhi, Michael Sioutis:
A Decomposition Framework for Inconsistency Handling in Qualitative Spatial and Temporal Reasoning. KR 2023: 604-613 - [c56]Yakoub Salhi, Michael Sioutis:
Prime Scenarios in Qualitative Spatial and Temporal Reasoning. TIME 2023: 5:1-5:14 - [c55]Yakoub Salhi, Michael Sioutis:
A Decomposition Framework for Inconsistency Handling in Qualitative Spatial and Temporal Reasoning (Extended Abstract). TIME 2023: 16:1-16:3 - 2022
- [c54]Abderrahmane Boukontar, Jean-François Condotta, Yakoub Salhi:
Knowledge Discovery from Qualitative Spatial and Temporal Data. ICTAI 2022: 451-458 - [c53]Souhila Kaci, Yakoub Salhi:
Belief selection through argumentation. SAC 2022: 889-896 - 2021
- [c52]Yakoub Salhi:
Quantification of Resource Production Incompleteness. AAAI 2021: 6480-6487 - [c51]Yakoub Salhi:
Inconsistency Measurement for Paraconsistent Inference. IJCAI 2021: 2033-2039 - 2020
- [c50]Yakoub Salhi:
A Framework for Measuring Information Asymmetry. AAAI 2020: 2983-2990 - [c49]Yakoub Salhi:
Inconsistency Measurement for Improving Logical Formula Clustering. IJCAI 2020: 1891-1897 - [c48]Yakoub Salhi
On Reasoning about Access to Knowledge. LPAR 2020: 449-464 - [c47]Yakoub Salhi
On satisfiability problem in modal logic S5. SAC 2020: 948-955
2010 – 2019
- 2019
- [b2]Yakoub Salhi:
ModéLisation et logique propositionnelle classique. (Modeling and Classical Propositional Logic). Artois University, Arras, France, 2019 - [c46]Yakoub Salhi:
On an Argument-centric Persuasion Framework. AAMAS 2019: 1279-1287 - [c45]Yakoub Salhi:
Entailment Functions and Reasoning Under Inconsistency. AAMAS 2019: 2183-2185 - [c44]Yakoub Salhi
On Enumerating All the Minimal Models for Particular CNF Formula Classes. ICAART (2) 2019: 403-410 - [c43]Yazid Boumarafi, Yakoub Salhi
On Solving Exactly-One-SAT. ICTAI 2019: 10-17 - [c42]Yakoub Salhi
Measuring Inconsistency Through Subformula Forgetting. SUM 2019: 184-191 - [c41]Yakoub Salhi
Qualitative Reasoning and Data Mining. TIME 2019: 9:1-9:15 - 2018
- [j11]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
SAT-Based Data Mining. Int. J. Artif. Intell. Tools 27(1): 1840002:1-1840002:24 (2018) - [j10]Saïd Jabbour, Jerry Lonlac
Revisiting the Learned Clauses Database Reduction Strategies. Int. J. Artif. Intell. Tools 27(8): 1850033:1-1850033:19 (2018) - [j9]Didier Galmiche, Yakoub Salhi
Tree-sequent calculi and decision procedures for intuitionistic modal logics. J. Log. Comput. 28(5): 967-989 (2018) - [c40]Yazid Boumarafi, Yakoub Salhi
Tractable Classes in Exactly-One-SAT. AIMSA 2018: 197-206 - [c39]Yakoub Salhi
Approaches for Enumerating All the Essential Prime Implicants. AIMSA 2018: 228-239 - [c38]Yakoub Salhi:
A Method for Generating all the Prime Implicants of Binary CNF Formulas. ISAIM 2018 - 2017
- [j8]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Mining Top-k motifs with a SAT-based framework. Artif. Intell. 244: 30-47 (2017) - [j7]Meriem Ammoura
On an MCS-based inconsistency measure. Int. J. Approx. Reason. 80: 443-459 (2017) - [j6]Michael Sioutis
Studying the use and effect of graph decomposition in qualitative spatial and temporal reasoning. Knowl. Eng. Rev. 32: e4 (2017) - [c37]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Une approche logique pour la fouille de règles d'association. EGC 2017: 357-362 - [c36]Soukaina Hattad, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Enhancing Pigeon-Hole based Encoding of Boolean Cardinality Constraints. ICAART (2) 2017: 299-307 - [c35]Yazid Boumarafi, Lakhdar Sais, Yakoub Salhi
From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes. LPAR 2017: 286-299 - [c34]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Clustering Complex Data Represented as Propositional Formulas. PAKDD (2) 2017: 441-452 - [c33]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Enumerating Non-redundant Association Rules Using Satisfiability. PAKDD (1) 2017: 824-836 - 2016
- [j5]Jean-François Condotta, Souhila Kaci, Yakoub Salhi
Optimization in temporal qualitative constraint networks. Acta Informatica 53(2): 149-170 (2016) - [c32]Saïd Jabbour, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi
On the Computation of Top-k Extensions in Abstract Argumentation Frameworks. ECAI 2016: 913-920 - [c31]Saïd Jabbour, Souhila Kaci, Lakhdar Sais, Yakoub Salhi
Itemset Mining with Penalties. ICTAI 2016: 962-966 - [c30]Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
A SAT-Based Approach for Mining Association Rules. IJCAI 2016: 2472-2478 - [c29]Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi:
A MIS Partition Based Framework for Measuring Inconsistency. KR 2016: 84-93 - [c28]Jean-François Condotta, Badran Raddaoui, Yakoub Salhi:
Quantifying Conflicts for Spatial and Temporal Information. KR 2016: 443-452 - 2015
- [c27]Imen Ouled Dlala, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Parallel SAT based closed frequent itemsets enumeration. AICCSA 2015: 1-8 - [c26]Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi:
On Structure-Based Inconsistency Measures and Their Computations via Closed Set Packing. AAMAS 2015: 1749-1750 - [c25]Meriem Ammoura, Badran Raddaoui, Yakoub Salhi
On Measuring Inconsistency Using Maximal Consistent Sets. ECSQARU 2015: 267-276 - [c24]Michael Sioutis, Yakoub Salhi, Jean-François Condotta:
A Simple Decomposition Scheme for Large Real World Qualitative Constraint Networks. FLAIRS 2015: 119-122 - [c23]Yakoub Salhi
A Resolution Method for Modal Logic S5. GCAI 2015: 252-262 - [c22]Saïd Jabbour, Stéphanie Roussel
Mining to Compress Table Constraints. ICTAI 2015: 405-412 - [c21]Michael Sioutis
Ordering Spatio-Temporal Sequences to Meet Transition Constraints: Complexity and Framework. AIAI 2015: 130-150 - [c20]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Decomposition Based SAT Encodings for Itemset Mining Problems. PAKDD (2) 2015: 662-674 - [c19]Michael Sioutis
On the use and effect of graph decomposition in qualitative spatial and temporal reasoning. SAC 2015: 1874-1879 - [c18]Michael Sioutis
Generalized Qualitative Spatio-Temporal Reasoning: Complexity and Tableau Method. TABLEAUX 2015: 54-69 - [i5]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
On SAT Models Enumeration in Itemset Mining. CoRR abs/1506.02561 (2015) - 2014
- [c17]Souhila Kaci, Yakoub Salhi:
A Constructive Argumentation Framework. AAAI 2014: 1070-1076 - [c16]Michael Sioutis
A Qualitative Spatio-Temporal Framework Based on Point Algebra. AIMSA 2014: 117-128 - [c15]Saïd Jabbour, Mehdi Khiari, Lakhdar Sais, Yakoub Salhi, Karim Tabia:
Symétries et Extraction de Motifs Ensemblistes. EGC 2014: 407-418 - [c14]Belaïd Benhamou, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Symmetry Breaking in Itemset Mining. KDIR 2014: 86-96 - [c13]Belaïd Benhamou, Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
A Generic and Declarative Method for Symmetry Breaking in Itemset Mining. IC3K (Selected Papers) 2014: 143-160 - [c12]Saïd Jabbour, Jerry Lonlac
Extending modern SAT solvers for models enumeration. IRI 2014: 803-810 - [c11]Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi:
A Pigeon-Hole Based Encoding of Cardinality Constraints. ISAIM 2014 - [c10]Saïd Jabbour, João Marques-Silva, Lakhdar Sais, Yakoub Salhi
Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form. JELIA 2014: 152-165 - [i4]Saïd Jabbour, Jerry Lonlac, Lakhdar Sais, Yakoub Salhi:
Revisiting the Learned Clauses Database Reduction Strategies. CoRR abs/1402.1956 (2014) - [i3]Saïd Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi:
On the measure of conflicts: A MUS-Decomposition Based Framework. CoRR abs/1406.0155 (2014) - 2013
- [j4]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
A Pigeon-Hole Based Encoding of Cardinality Constraints. Theory Pract. Log. Program. 13(4-5-Online-Supplement) (2013) - [c9]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Mining-based compression approach of propositional formulae. CIKM 2013: 289-298 - [c8]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Boolean satisfiability for sequence mining. CIKM 2013: 649-658 - [c7]Saïd Jabbour, Mehdi Khiari, Lakhdar Sais, Yakoub Salhi
Symmetry-Based Pruning in Itemset Mining. ICTAI 2013: 483-490 - [c6]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
The Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem. ECML/PKDD (3) 2013: 403-418 - [i2]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
Mining to Compact CNF Propositional Formulae. CoRR abs/1304.4415 (2013) - [i1]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi:
A Mining-Based Compression Approach for Constraint Satisfaction Problems. CoRR abs/1305.3321 (2013) - 2012
- [c5]Emmanuel Coquery, Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi
A SAT-Based Approach for Discovering Frequent, Closed and Maximal Patterns in a Sequence. ECAI 2012: 258-263 - [c4]Saïd Jabbour, Lakhdar Sais, Yakoub Salhi
Symmetries in Itemset Mining. ECAI 2012: 432-437 - [c3]Yakoub Salhi
Graded Modal Logic GS5 and Itemset Support Satisfiability. ISIP 2012: 131-140 - 2011
- [j3]Didier Galmiche, Yakoub Salhi
Sequent calculi and decidability for intuitionistic hybrid logic. Inf. Comput. 209(12): 1447-1463 (2011) - 2010
- [b1]Yakoub Salhi:
Structures Multi-contextuelles et Logiques Modales Intuitionnistes et Hybrides. (Multi-contextual Structures and Intuitionistic and Hybrid modal logics). Henri Poincaré University, Nancy, France, 2010 - [j2]Didier Galmiche, Yakoub Salhi
Label-free natural deduction systems for intuitionistic and classical modal logics. J. Appl. Non Class. Logics 20(4): 373-421 (2010) - [j1]Didier Galmiche, Yakoub Salhi
A family of Gödel hybrid logics. J. Appl. Log. 8(4): 371-385 (2010) - [c2]Didier Galmiche, Yakoub Salhi
Label-Free Proof Systems for Intuitionistic Modal Logic IS5. LPAR (Dakar) 2010: 255-271
2000 – 2009
- 2008
- [c1]Didier Galmiche, Yakoub Salhi
Labelled Calculi for Lukasiewicz Logics. WoLLIC 2008: 194-207
Coauthor Index
aka: Lakhdar Saïs
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: