Comparison Between SAT-Based and CSP-Based Approaches to Resolve Pattern Mining Problems

被引:0
|
作者
Rajeb, Akram [1 ]
Ben Hamadou, Abdelmajid [1 ]
Loukil, Zied [1 ]
机构
[1] Univ Sfax, MIRACL Lab, Sfax, Tunisia
来源
关键词
D O I
10.1007/978-3-319-27221-4_26
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The pattern mining in sequences is an important research field, especially in computational biology and text mining. Many approaches are proposed to resolve this problem. The declarative approach is one of them and consists to transform the pattern mining problem into another NP-Complete problem like SAT and CSP. In this paper, we try to compare several techniques of pattern mining problems resolution after transforming them into SAT and CSP problems.
引用
收藏
页码:307 / 314
页数:8
相关论文
共 50 条
  • [1] SAT-Based Data Mining
    Boudane, Abdelhamid
    Jabbour, Said
    Sais, Lakhdar
    Salhi, Yakoub
    [J]. INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2018, 27 (01)
  • [2] A Study of SAT-Based Branching Heuristics for the CSP
    Argyropoulos, Yannis
    Stergiou, Kostas
    [J]. ARTIFICIAL INTELLIGENCE: THEORIES, MODELS AND APPLICATIONS, SETN 2008, 2008, 5138 : 38 - 50
  • [3] On the Complexity of CSP-Based Ideal Membership Problems
    Bulatov, Andrei A.
    Rafiey, Akbar
    [J]. PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 436 - 449
  • [4] Analyzing pathways using SAT-Based approaches
    Tiwari, Ashish
    Talcott, Carolyn
    Knapp, Merrill
    Lincoln, Patrick
    Laderoute, Keith
    [J]. ALGEBRAIC BIOLOGY, PROCEEDINGS, 2007, 4545 : 155 - +
  • [5] SAT-Based Approaches to Treewidth Computation: An Evaluation
    Berg, Jeremias
    Jarvisalo, Matti
    [J]. 2014 IEEE 26TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2014, : 328 - 335
  • [6] Enhancing SAT-Based Test Pattern Generation
    刘歆
    熊有伦
    [J]. Journal of Electronic Science and Technology, 2005, (02) : 134 - 139
  • [7] SAT-based State Justification with Adaptive Mining of Invariants
    Wu, Weixin
    Hsiao, Michael S.
    [J]. 2008 IEEE INTERNATIONAL TEST CONFERENCE, VOLS 1 AND 2, PROCEEDINGS, 2008, : 176 - 185
  • [8] Unifying SAT-Based Approaches to Maximum Satisfiability Solving
    Ihalainen, Hannes
    Berg, Jeremias
    Jarvisalo, Matti
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2024, 80 : 931 - 976
  • [9] Improving test pattern compactness in SAT-based ATPG
    Eggersgluess, Stephan
    Drechsler, Rolf
    [J]. PROCEEDINGS OF THE 16TH ASIAN TEST SYMPOSIUM, 2007, : 445 - 450
  • [10] Unifying SAT-Based Approaches to Maximum Satisfiability Solving
    Ihalainen, Hannes
    Berg, Jeremias
    Järvisalo, Matti
    [J]. Journal of Artificial Intelligence Research, 2024, 80 : 931 - 976