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 条
  • [21] Learning from conflicts in propositional satisfiability
    Youssef Hamadi
    Saïd Jabbour
    Lakhdar Saïs
    4OR, 2012, 10 : 15 - 32
  • [22] Dependent and independent variables in propositional satisfiability
    Giunchiglia, E
    Maratea, M
    Tacchella, A
    LOGICS IN ARTIFICIAL INTELLIGENCE 8TH, 2002, 2424 : 296 - 307
  • [23] A New Branching Heuristic for Propositional Satisfiability
    Zhao, Yujuan
    Song, Zhenming
    2016 INTERNATIONAL CONFERENCE ON FUZZY THEORY AND ITS APPLICATIONS (IFUZZY), 2016,
  • [24] Propositional satisfiability: Techniques, algorithms and applications
    Lynce, Ines
    AI COMMUNICATIONS, 2006, 19 (02) : 187 - 189
  • [25] A complete adaptive algorithm for propositional satisfiability
    Bruni, R
    Sassano, A
    DISCRETE APPLIED MATHEMATICS, 2003, 127 (03) : 523 - 534
  • [26] ALGORITHMS FOR TESTING THE SATISFIABILITY OF PROPOSITIONAL FORMULAS
    GALLO, G
    URBANI, G
    JOURNAL OF LOGIC PROGRAMMING, 1989, 7 (01): : 45 - 61
  • [27] Learning from conflicts in propositional satisfiability
    Hamadi, Youssef
    Jabbour, Said
    Sais, Lakhdar
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (01): : 15 - 32
  • [28] Scalable Formula Decomposition for Propositional Satisfiability
    Monnet, Anthony
    Villemaire, Roger
    PROCEEDINGS OF THE THIRD C* CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING 2010 (C3S2E '10), 2010, : 43 - 52
  • [29] Reducing inductive definitions to propositional satisfiability
    Pelov, N
    Ternovska, E
    LOGIC PROGRAMMING, PROCEEDINGS, 2005, 3668 : 221 - 234
  • [30] Strong conflict analysis for propositional satisfiability
    Jin, HoonSang
    Somenzi, Fabio
    2006 DESIGN AUTOMATION AND TEST IN EUROPE, VOLS 1-3, PROCEEDINGS, 2006, : 816 - 821
12345