Combining inference and search for the propositional satisfiability problem

被引：0
|
作者：
Drake, L [1 ]
Frisch, A [1 ]
Walsh, T [1 ]
机构：
[1] Univ York, Dept Comp Sci, York YO10 5DD, N Yorkshire, England
来源：
EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS | 2002年
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The most effective complete method for testing propositional satisfiability (SAT) is backtracking search. Recent research suggests that adding more inference to SAT search procedures can improve their performance. This paper presents two ways to combine neighbour resolution (one such inference technique) with search.
引用
收藏
页码：982 / 982
页数：1
相关论文
共 50 条
  • [1] GRASP: A search algorithm for propositional satisfiability
    Marques-Silva, JP
    Sakallah, KA
    IEEE TRANSACTIONS ON COMPUTERS, 1999, 48 (05) : 506 - 521
  • [2] Complete local search for propositional satisfiability
    Fang, H
    Ruml, W
    PROCEEDING OF THE NINETEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE SIXTEENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2004, : 161 - 166
  • [3] Economic sanctions as the propositional satisfiability problem
    Dragan Miljkovic
    Policy Sciences, 2002, 35 : 1 - 15
  • [4] A NEW ALGORITHM FOR THE PROPOSITIONAL SATISFIABILITY PROBLEM
    GALLO, G
    PRETOLANI, D
    DISCRETE APPLIED MATHEMATICS, 1995, 60 (1-3) : 159 - 179
  • [5] Economic sanctions as the propositional satisfiability problem
    Miljkovic, D
    POLICY SCIENCES, 2002, 35 (01) : 1 - 15
  • [6] Separating signs in the propositional satisfiability problem
    Hirsch E.A.
    Journal of Mathematical Sciences, 2000, 98 (4) : 442 - 463
  • [7] Complexity of the Satisfiability Problem for a Class of Propositional Schemata
    Aravantinos, Vincent
    Caferra, Ricardo
    Peltier, Nicolas
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2010, 6031 : 58 - 69
  • [8] Simplifying the propositional satisfiability problem by sub-model propagation
    Kusper, Gabor
    Csoke, Lajos
    Kovasznai, Gergely
    ANNALES MATHEMATICAE ET INFORMATICAE, 2008, 35 : 75 - 94
  • [9] Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability
    Belov, Anton
    Stachniak, Zbigniew
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2009, PROCEEDINGS, 2009, 5584 : 258 - 264
  • [10] From propositional satisfiability to satisfiability modulo theories
    Sheini, Hossein M.
    Sakallah, Karem A.
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2006, PROCEEDINGS, 2006, 4121 : 1 - 9
12345