A SAT-Based Approach to MinSAT

被引：8
|
作者：
Ansotegui, Carlos [1 ]
Li, Chu Min [2 ]
Manya, Felip [3 ]
Zhu, Zhu [2 ]
机构：
[1] Univ Lleida, Lleida, Spain
[2] Univ Picardie Jules Verne, MIS, Amiens, France
[3] CSIC, Artificial Intelligence Res Inst IIIA, Bellaterra, Spain
来源：
ARTIFICIAL INTELLIGENCE RESEARCH AND DEVELOPMENT | 2012年 / 248卷
关键词：
Boolean Optimization; MinSAT; MaxSAT;
D O I：
10.3233/978-1-61499-139-7-185
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A Partial MinSAT instance is a set of clauses where each clause is declared to be either hard or soft, and the Partial MinSAT problem consists in finding an assignment that satisfies all the hard clauses, and minimizes the number of satisfied soft clauses. In this paper we present an algorithm for solving Partial MinSAT that relies on solving a sequence of SAT instances, and report on an empirical investigation that provides evidence that our approach solves crafted and industrial instances that are beyond the reach of existing approaches to Partial MinSAT.
引用
收藏
页码：185 / +
页数：2
相关论文
共 50 条
  • [1] Logic as energy:: A SAT-Based approach
    Lima, Priscila M. V.
    Mariela, M.
    Morveli-Espinoza, M.
    Franca, Felipe M. G.
    [J]. ADVANCES IN BRAIN, VISION, AND ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2007, 4729 : 458 - +
  • [2] The SAT-based approach to separation logic
    Armando, Alessandro
    Castellini, Claudio
    Giunchiglia, Enrico
    Maratea, Marco
    [J]. JOURNAL OF AUTOMATED REASONING, 2005, 35 (1-3) : 237 - 263
  • [3] The SAT-based Approach to Separation Logic
    Alessandro Armando
    Claudio Castellini
    Enrico Giunchiglia
    Marco Maratea
    [J]. Journal of Automated Reasoning, 2005, 35 : 237 - 263
  • [4] The SAT-based approach for classical modal logics
    Giunchiglia, E
    Giunchiglia, F
    Tacchella, A
    [J]. AI*IA 99: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2000, 1792 : 95 - 106
  • [5] A SAT-based approach to multiple sequence alignment
    Prestwich, S
    Higgins, D
    O'Sullivan, O
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS, 2003, 2833 : 940 - 944
  • [6] A Novel SAT-Based Approach to Model Based Diagnosis
    Metodi, Amit
    Stern, Roni
    Kalech, Meir
    Codish, Michael
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2014, 51 : 377 - 411
  • [7] A SAT-Based Approach For PSPACE Modal Logics
    Lagniez, Jean-Marie
    Le Berre, Daniel
    de Lima, Tiago
    Montmirail, Valentin
    [J]. SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 651 - 652
  • [8] Lilotane: A lifted sat-based approach to hierarchical planning
    Schreiber, Dominik
    [J]. Journal of Artificial Intelligence Research, 2021, 70 : 1117 - 1181
  • [9] A SAT-Based Approach to Learn Explainable Decision Sets
    Ignatiev, Alexey
    Pereira, Filipe
    Narodytska, Nina
    Marques-Silva, Joao
    [J]. AUTOMATED REASONING, IJCAR 2018, 2018, 10900 : 627 - 645
  • [10] An Incremental SAT-Based Approach to the Graph Colouring Problem
    Glorian, Gael
    Lagniez, Jean-Marie
    Montmirail, Valentin
    Szczepanski, Nicolas
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2019, 2019, 11802 : 213 - 231
12345