Investigation of Maximum and Minimum Satisfiability Problems Using L-Partition

被引：0
|
作者：
A. V. Adel'shin
机构：
[1] Omsk Affiliated Institute of Mathematics,
[2] Siberian Branch,undefined
[3] Russian Academy of Sciences,undefined
来源：
Automation and Remote Control | 2004年 / 65卷
关键词：
Mechanical Engineer; System Theory; Integer Linear Programming; Satisfiability Problem; Unweighted Problem;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Problems of the maximum and the minimum satisfiability on the basis of the integer linear programming and L-partition are studied. The L-structure of polyhedrons of the problems is investigated. Families are set up of unweighted problems of the maximum and the minimum satisfiability, the powers of L-coverings of which grow exponentially with an increase in the number of variables in a formula.
引用
收藏
页码：388 / 395
页数：7
相关论文
共 50 条
  • [21] Trap escaping strategies in discrete Lagrangian methods for solving hard satisfiability and maximum satisfiability problems
    Wu, Z
    Wah, BW
    SIXTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-99)/ELEVENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE (IAAI-99), 1999, : 673 - 678
  • [22] Trap escaping strategies in discrete Lagrangian methods for solving hard satisfiability and maximum satisfiability problems
    Wu, Zhe
    Wah, Benjamin W.
    Proceedings of the National Conference on Artificial Intelligence, 1999, : 673 - 678
  • [23] Maximum Satisfiability Using Cores and Correction Sets
    Bjorner, Nikolaj
    Narodytska, Nina
    PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 246 - 252
  • [24] Improved design debugging using maximum satisfiability
    Safarpour, Sean
    Mangassarian, Hratch
    Veneris, Andreas
    Liffiton, Mark H.
    Sakallah, Karem A.
    FMCAD 2007: FORMAL METHODS IN COMPUTER AIDED DESIGN, PROCEEDINGS, 2007, : 13 - +
  • [25] Algorithms for maximum satisfiability using unsatisfiable cores
    Marques-Silva, Joao
    Planes, Jordi
    2008 DESIGN, AUTOMATION AND TEST IN EUROPE, VOLS 1-3, 2008, : 365 - 370
  • [26] On the minimum monochromatic or multicolored subgraph partition problems
    Li, Xueliang
    Zhang, Xiaoyan
    THEORETICAL COMPUTER SCIENCE, 2007, 385 (1-3) : 1 - 10
  • [27] New local search approximation techniques for maximum generalized satisfiability problems
    Dipto. di Informatica e Sistemistica, Univ. Studi di Roma la Sapienza, via Salaria 113, Roma 00198, Italy
    Inf. Process. Lett., 3 (151-158):
  • [28] New local search approximation techniques for maximum generalized satisfiability problems
    Alimonti, P
    INFORMATION PROCESSING LETTERS, 1996, 57 (03) : 151 - 158
  • [29] On the complexity of the minimum and maximum global snapshot problems
    Chen, LB
    Wu, IC
    COMPSAC 97 : TWENTY-FIRST ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE, 1997, : 38 - 41
  • [30] MAXIMUM-MINIMUM DUALITY IN EXTREMAL PROBLEMS
    SHAPIRO, HS
    BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1952, 58 (05) : 570 - 571
12345