SATISFIABILITY TESTING IN THE CONTEXT OF HYPERGRAPHS

被引：0
作者：
Hvalica, Dusan [1 ]
机构：
[1] Univ Ljubljana, Fac Econ, Ljubljana 61000, Slovenia
来源：
PROCEEDINGS OF THE 10TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH SOR 09 | 2009年
关键词：
satisfiability; hypergraph; supporting bundle; FORMULAS;
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
An algorithm for searching for supporting bundles is described, which allows for solving instances of SAT in the context of hypergraphs.
引用
收藏
页码：93 / 99
页数：7
相关论文
共 11 条
  • [1] Acharyya S, 2008, LECT NOTES ENG COMP, P64
  • [2] COWEN R, 2001, REPORTS MATH LOGIC, V35, P61
  • [3] COWEN RH, 1991, REPORTS MATH LOGIC, V25, P113
  • [4] ERNST MD, 1997, 15 INT JOINT C ART I, P1169
  • [5] DIRECTED HYPERGRAPHS AND APPLICATIONS
    GALLO, G
    LONGO, G
    PALLOTTINO, S
    NGUYEN, S
    [J]. DISCRETE APPLIED MATHEMATICS, 1993, 42 (2-3) : 177 - 201
  • [6] ALGORITHMS FOR TESTING THE SATISFIABILITY OF PROPOSITIONAL FORMULAS
    GALLO, G
    URBANI, G
    [J]. JOURNAL OF LOGIC PROGRAMMING, 1989, 7 (01): : 45 - 61
  • [7] GALLO G, 1986, MATH PROGRAMMING STU, V26, P45
  • [8] Kolany A., 1993, Studia Logica, V52, P393, DOI 10.1007/BF01057654
  • [9] Kundu S., 2008, TENCON 2008 IEEE REG, P1
  • [10] MERNIK SO, 2002, P INT C COMP DES, P395
12