GRASP: a search algorithm for propositional satisfiability
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques that proved to be quite powerful on a wide variety of SAT problems. Some of these techniques are...
Saved in:
| Published in | IEEE transactions on computers Vol. 48; no. 5; pp. 506 - 521 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
New York, NY
IEEE
01.05.1999
Institute of Electrical and Electronics Engineers |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0018-9340 |
| DOI | 10.1109/12.769433 |
Cover
| Abstract | This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques that proved to be quite powerful on a wide variety of SAT problems. Some of these techniques are specific to SAT, whereas others are similar in spirit to approaches in other fields of Artificial Intelligence. GRASP is premised on the inevitability of conflicts during the search and its most distinguishing feature is the augmentation of basic backtracking search with a powerful conflict analysis procedure. Analyzing conflicts to determine their causes enables GRASP to backtrack nonchronologically to earlier levels in the search tree, potentially pruning large portions of the search space. In addition, by "recording" the causes of conflicts, GRASP can recognize and preempt the occurrence of similar conflicts later on in the search. Finally, straightforward bookkeeping of the causality chains leading up to conflicts allows GRASP to identify assignments that are necessary for a solution to be found. Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for a large number of representative classes of SAT instances. |
|---|---|
| AbstractList | This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques that proved to be quite powerful on a wide variety of SAT problems. Some of these techniques are specific to SAT, whereas others are similar in spirit to approaches in other fields of Artificial Intelligence. GRASP is premised on the inevitability of conflicts during the search and its most distinguishing feature is the augmentation of basic backtracking search with a powerful conflict analysis procedure. Analyzing conflicts to determine their causes enables GRASP to backtrack nonchronologically to earlier levels in the search tree, potentially pruning large portions of the search space. In addition, by "recording" the causes of conflicts, GRASP can recognize and preempt the occurrence of similar conflicts later on in the search. Finally, straightforward bookkeeping of the causality chains leading up to conflicts allows GRASP to identify assignments that are necessary for a solution to be found. Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for a large number of representative classes of SAT instances This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques that proved to be quite powerful on a wide variety of SAT problems. Some of these techniques are specific to SAT, whereas others are similar in spirit to approaches in other fields of Artificial Intelligence. GRASP is premised on the inevitability of conflicts during the search and its most distinguishing feature is the augmentation of basic backtracking search with a powerful conflict analysis procedure. Analyzing conflicts to determine their causes enables GRASP to backtrack nonchronologically to earlier levels in the search tree, potentially pruning large portions of the search space. In addition, by `recording' the causes of conflicts, GRASP can recognize and preempt the occurrence of similar conflicts later on in the search. Finally, straightforward bookkeeping of the causality chains leading up to conflicts allows GRASP to identify assignments that are necessary for a solution to be found. Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for a large number of representative classes of SAT instances. |
| Author | Sakallah, K.A. Marques-Silva, J.P. |
| Author_xml | – sequence: 1 givenname: J.P. surname: Marques-Silva fullname: Marques-Silva, J.P. organization: IST, INESC, Lisbon, Portugal – sequence: 2 givenname: K.A. surname: Sakallah fullname: Sakallah, K.A. |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1838691$$DView record in Pascal Francis |
| BookMark | eNqF0b9PAjEUB_AOmAjo4Op0gzE6HPRdodeyEaJoQqLxx9y89lqpOe6wPQb-e49AGIzRpW_o533z8l6PdKq6soRcAB0AUDmEbJBzOWKsQ7qUgkglG9FT0ovxk1LKMyq7ZDJ_mb4-TxJMosVglgmWH3XwzXKVuDok61Cv6-gbX1dYJhEbH51H7UvfbM_IicMy2vND7ZP3-7u32UO6eJo_zqaL1IwYb9KcAhbaaaORUZ7nQo_HtBgVtrBCGl4UBYLOnOBMWMm11RYYijEwh9rIzLE-ud7ntsN8bWxs1MpHY8sSK1tvosoEy4C277-Qy7EQXLbw5k8IPAdGIYMdvTpQjAZLF7AyPqp18CsMWwWCtYHQsuGemVDHGKxTxje4W1sT0JcKqNqdREGm9idpO25_dBwzf7GXe-uttUd3-PwGi8qXEg |
| CODEN | ITCOB4 |
| CitedBy_id | crossref_primary_10_1016_j_entcs_2005_07_018 crossref_primary_10_1007_s10601_007_9022_z crossref_primary_10_1109_TC_2006_75 crossref_primary_10_1007_s42452_020_03758_z crossref_primary_10_1109_TCAD_2002_804386 crossref_primary_10_1109_TCAD_2002_804387 crossref_primary_10_1145_3176644 crossref_primary_10_1017_S1471068418000558 crossref_primary_10_1109_TC_2004_1 crossref_primary_10_1016_j_jpdc_2016_12_014 crossref_primary_10_1155_2022_2677457 crossref_primary_10_1016_j_knosys_2022_108572 crossref_primary_10_1016_S0004_3702_02_00120_0 crossref_primary_10_1134_S1064230709050062 crossref_primary_10_1109_TCAD_2015_2446950 crossref_primary_10_1007_s10696_021_09438_3 crossref_primary_10_1145_1550987_1550995 crossref_primary_10_1016_j_vlsi_2010_08_002 crossref_primary_10_1109_ACCESS_2022_3174564 crossref_primary_10_1016_S0166_218X_02_00399_2 crossref_primary_10_1016_j_apal_2011_09_009 crossref_primary_10_1109_MCAS_2005_1550165 crossref_primary_10_1109_TCAD_2004_828122 crossref_primary_10_1016_j_dam_2006_11_012 crossref_primary_10_1109_TCAD_2008_2006156 crossref_primary_10_1016_j_sysarc_2022_102615 crossref_primary_10_1007_s10479_010_0693_2 crossref_primary_10_1007_s10489_021_02918_x crossref_primary_10_1137_120895950 crossref_primary_10_1007_s10836_010_5142_2 crossref_primary_10_1145_2898435 crossref_primary_10_1109_TCAD_2011_2169259 crossref_primary_10_1109_TCAD_2006_884863 crossref_primary_10_1016_S1571_0661_05_82542_3 crossref_primary_10_1016_j_dam_2024_10_021 crossref_primary_10_1145_566385_566390 crossref_primary_10_1137_20M1362528 crossref_primary_10_3390_a15010015 crossref_primary_10_1007_s00037_023_00242_z crossref_primary_10_1002_aisy_202200202 crossref_primary_10_1016_j_ijar_2024_109135 crossref_primary_10_1007_s10472_005_0421_9 crossref_primary_10_1007_s11390_005_0004_6 crossref_primary_10_1134_S000511791604007X crossref_primary_10_1016_j_ipl_2018_04_014 crossref_primary_10_1016_S1571_0661_04_00331_7 crossref_primary_10_1111_cogs_13102 crossref_primary_10_1007_s00453_016_0228_6 crossref_primary_10_1016_j_procs_2017_05_140 crossref_primary_10_1109_TC_2006_175 crossref_primary_10_4213_dm1043 crossref_primary_10_1109_TC_2006_170 crossref_primary_10_1109_TCAD_2005_853700 crossref_primary_10_1016_j_ins_2023_119751 crossref_primary_10_1016_j_artint_2015_01_002 crossref_primary_10_1016_j_artint_2013_07_006 crossref_primary_10_1007_s10732_021_09475_z crossref_primary_10_1016_j_proenv_2011_12_020 crossref_primary_10_1109_TC_2004_102 crossref_primary_10_1016_j_dam_2005_10_021 crossref_primary_10_1016_j_cie_2020_106777 crossref_primary_10_1007_s10817_010_9176_z crossref_primary_10_1016_j_ejor_2015_08_044 crossref_primary_10_1080_0952813X_2014_954274 crossref_primary_10_1109_TCAD_2003_819900 crossref_primary_10_1007_s11334_022_00460_8 crossref_primary_10_1142_S1469026808002193 crossref_primary_10_1109_TSE_2008_50 crossref_primary_10_1017_S147106841300032X crossref_primary_10_2200_S00529ED1V01Y201308AIM023 crossref_primary_10_1016_j_cor_2019_05_004 crossref_primary_10_1016_j_mejo_2007_05_001 crossref_primary_10_1155_2011_365107 crossref_primary_10_1007_s10817_009_9127_8 crossref_primary_10_1007_s10479_015_2028_9 crossref_primary_10_1007_s11767_014_3158_y crossref_primary_10_1007_s10817_020_09554_z crossref_primary_10_1145_2019583_2019584 crossref_primary_10_1142_S0218488524500296 crossref_primary_10_1016_j_ejor_2022_02_043 crossref_primary_10_3390_a15090302 crossref_primary_10_1007_s10601_008_9061_0 crossref_primary_10_3745_KIPSTD_2009_16D_6_911 crossref_primary_10_1007_s00291_015_0419_6 crossref_primary_10_1016_j_disopt_2006_10_006 crossref_primary_10_1109_TFUZZ_2016_2637374 crossref_primary_10_1007_s10601_008_9062_z crossref_primary_10_1007_s10601_020_09318_x crossref_primary_10_1016_j_artint_2019_103197 crossref_primary_10_1016_j_tcs_2008_03_013 crossref_primary_10_3390_sym2021121 crossref_primary_10_1016_j_sysarc_2004_10_006 crossref_primary_10_1142_s0218213015500050 crossref_primary_10_1007_s12532_009_0009_1 crossref_primary_10_21105_joss_00639 crossref_primary_10_1145_504914_504916 crossref_primary_10_1109_TC_2007_1075 crossref_primary_10_1109_TCAD_2003_816218 crossref_primary_10_1007_s10472_010_9173_2 crossref_primary_10_1016_j_orp_2017_01_002 crossref_primary_10_3389_fphys_2018_00431 crossref_primary_10_1007_s10472_016_9515_9 crossref_primary_10_1016_j_entcs_2004_09_042 crossref_primary_10_1016_j_mejo_2015_05_003 crossref_primary_10_4028_www_scientific_net_AMR_301_303_1089 crossref_primary_10_1109_TC_2011_49 crossref_primary_10_6109_jkiice_2016_20_10_1919 crossref_primary_10_1016_j_ifacol_2021_04_045 crossref_primary_10_1145_1217856_1217859 crossref_primary_10_1016_j_artint_2023_103931 crossref_primary_10_1016_S1383_7621_03_00067_5 crossref_primary_10_1016_j_ipl_2018_03_001 crossref_primary_10_1088_1755_1315_440_3_032143 crossref_primary_10_1016_j_entcs_2012_08_016 crossref_primary_10_1016_j_artint_2015_09_008 crossref_primary_10_1016_j_jss_2022_111570 crossref_primary_10_2200_S00457ED1V01Y201211AIM019 crossref_primary_10_1007_s10836_018_5747_4 crossref_primary_10_1145_2480759_2480767 crossref_primary_10_1007_s11390_005_0002_8 crossref_primary_10_1007_s10617_010_9052_4 crossref_primary_10_1007_s10703_006_0031_0 crossref_primary_10_1017_S0890060403171065 crossref_primary_10_1109_TC_2010_74 crossref_primary_10_1016_j_cor_2022_106075 crossref_primary_10_1109_TCAD_2013_2275431 crossref_primary_10_2478_v10127_010_0009_6 crossref_primary_10_1007_s10836_014_5452_x crossref_primary_10_1007_s11432_007_0070_1 crossref_primary_10_1038_s41598_018_24877_z crossref_primary_10_1007_s10878_008_9142_4 crossref_primary_10_1017_S1471068417000199 crossref_primary_10_1080_01605682_2021_1952117 crossref_primary_10_1002_scj_10482 crossref_primary_10_1007_s10472_007_9062_5 crossref_primary_10_1109_TCAD_2005_860955 crossref_primary_10_1371_journal_pone_0272967 crossref_primary_10_1007_s10817_021_09606_y crossref_primary_10_2200_S00893ED2V01Y201901AIM041 crossref_primary_10_1016_S0166_218X_02_00385_2 crossref_primary_10_1016_j_artint_2012_04_001 crossref_primary_10_1007_s12532_021_00202_0 crossref_primary_10_1587_transfun_E99_A_2302 crossref_primary_10_1016_j_artint_2021_103559 crossref_primary_10_1609_aimag_v37i4_2694 crossref_primary_10_1017_S1471068412000166 crossref_primary_10_1109_ACCESS_2021_3120597 crossref_primary_10_1007_s10664_019_09761_2 crossref_primary_10_1016_j_artint_2016_12_002 crossref_primary_10_1016_j_artint_2020_103397 crossref_primary_10_1016_j_artint_2021_103552 crossref_primary_10_1007_s13218_010_0008_4 crossref_primary_10_1609_aimag_v33i1_2395 crossref_primary_10_1007_s10515_022_00348_8 crossref_primary_10_1109_TCAD_2008_923107 crossref_primary_10_1016_j_cie_2019_106040 crossref_primary_10_1016_j_ejor_2019_07_056 crossref_primary_10_1109_TEVC_2019_2922419 crossref_primary_10_3390_math12233805 crossref_primary_10_1016_j_entcs_2004_08_061 crossref_primary_10_1007_s10115_015_0890_z crossref_primary_10_1145_3712193 crossref_primary_10_1587_transfun_E92_A_3086 crossref_primary_10_1016_S1571_0653_04_00318_X crossref_primary_10_3390_math10132264 crossref_primary_10_1016_j_artint_2013_10_001 crossref_primary_10_1007_s10817_016_9384_2 crossref_primary_10_1007_s10009_004_0183_4 crossref_primary_10_1145_2209291_2209297 crossref_primary_10_1145_2815493_2815497 crossref_primary_10_1016_j_jalgor_2008_02_007 crossref_primary_10_1016_j_jalgor_2008_02_006 crossref_primary_10_1016_j_jalgor_2008_02_005 crossref_primary_10_1109_TCAD_2011_2110590 crossref_primary_10_1137_16M1109072 crossref_primary_10_1016_j_artint_2012_08_001 crossref_primary_10_33889_IJMEMS_2018_3_1_005 crossref_primary_10_1007_s10619_010_7060_9 crossref_primary_10_1016_j_artint_2016_08_007 crossref_primary_10_1007_s10288_011_0191_7 crossref_primary_10_1016_j_infsof_2020_106296 crossref_primary_10_1109_TCAD_2009_2013269 crossref_primary_10_1016_j_cor_2008_08_017 crossref_primary_10_1007_s10601_005_2807_z crossref_primary_10_1007_s10462_018_9628_0 crossref_primary_10_1017_S1471068418000492 crossref_primary_10_1109_TVLSI_2004_825859 crossref_primary_10_1007_s10601_012_9121_3 crossref_primary_10_1109_MDT_2004_1277903 crossref_primary_10_1109_TVLSI_2008_2001943 crossref_primary_10_1145_3560469 crossref_primary_10_1007_s10703_013_0203_7 crossref_primary_10_1109_TVLSI_2011_2142407 crossref_primary_10_1587_transinf_2016EDP7487 crossref_primary_10_1016_j_disopt_2016_01_005 crossref_primary_10_1145_1592434_1592437 crossref_primary_10_1109_TCAD_2003_811450 crossref_primary_10_1016_j_artint_2006_11_003 crossref_primary_10_1109_TCAD_2003_814960 crossref_primary_10_1016_j_ejor_2011_03_019 crossref_primary_10_1080_00207160210938 crossref_primary_10_1017_S1471068418000145 crossref_primary_10_1109_TCAD_2010_2044673 crossref_primary_10_1007_s00500_022_06923_1 crossref_primary_10_1007_s00521_016_2599_7 crossref_primary_10_1145_3296979_3192382 crossref_primary_10_1109_TR_2020_3014012 crossref_primary_10_1109_TCAD_2004_842808 crossref_primary_10_1017_S1471068419000255 crossref_primary_10_1007_s10009_021_00641_z crossref_primary_10_1137_130914085 crossref_primary_10_1007_s11432_011_4368_7 crossref_primary_10_1007_s10479_009_0654_9 crossref_primary_10_1007_s10817_022_09658_8 crossref_primary_10_1145_2967101 crossref_primary_10_4304_jcp_8_4_851_858 crossref_primary_10_1016_j_tcs_2010_09_014 crossref_primary_10_1109_TCAD_2010_2041846 crossref_primary_10_1049_iet_wss_2011_0085 crossref_primary_10_1515_jisys_2016_0129 crossref_primary_10_1007_s10703_021_00363_7 crossref_primary_10_1016_j_jsc_2019_07_017 crossref_primary_10_3390_pr10020404 crossref_primary_10_1016_j_entcs_2006_12_019 crossref_primary_10_1017_S1471068411000548 crossref_primary_10_1145_1066100_1066102 crossref_primary_10_1016_S0747_7171_02_00091_3 crossref_primary_10_1109_TCAD_2013_2256461 crossref_primary_10_1007_s12532_008_0001_1 crossref_primary_10_1016_j_artint_2016_11_001 crossref_primary_10_1109_TNANO_2014_2361059 crossref_primary_10_1524_itit_2009_0529 crossref_primary_10_1109_TCAD_2004_836730 crossref_primary_10_3390_e24121846 crossref_primary_10_1016_j_fss_2018_09_008 crossref_primary_10_1109_TCAD_2012_2191288 crossref_primary_10_4304_jcp_6_11_2310_2320 crossref_primary_10_1038_s44335_024_00015_z crossref_primary_10_1016_j_artint_2014_11_008 crossref_primary_10_1016_S1571_0653_04_00322_1 crossref_primary_10_1145_2651400 crossref_primary_10_1109_JPROC_2015_2455034 crossref_primary_10_1007_s11633_022_1396_2 crossref_primary_10_1007_s10601_016_9267_5 crossref_primary_10_1541_ieejias_139_119 crossref_primary_10_1017_S1471068417000254 crossref_primary_10_1017_S1471068417000138 crossref_primary_10_1007_s10817_018_09501_z crossref_primary_10_1109_TCAD_2005_852031 crossref_primary_10_1186_s42787_019_0021_1 crossref_primary_10_1093_logcom_exp002 crossref_primary_10_1145_3449352 crossref_primary_10_1145_2975585 crossref_primary_10_1007_s10703_006_0019_9 crossref_primary_10_1145_3224206 crossref_primary_10_1016_j_artint_2019_103229 crossref_primary_10_3233_IA_240019 crossref_primary_10_2478_ausi_2018_0001 crossref_primary_10_1145_3491210 crossref_primary_10_1007_s13218_018_0550_z crossref_primary_10_1007_s10601_016_9257_7 crossref_primary_10_1007_s10472_012_9322_x crossref_primary_10_1016_j_cor_2011_02_008 crossref_primary_10_1007_s10479_021_04363_y crossref_primary_10_1109_TCAD_2009_2021008 crossref_primary_10_21099_tkbjm_20234701083 crossref_primary_10_4204_EPTCS_325_25 crossref_primary_10_1515_DMA_2009_009 crossref_primary_10_1016_j_entcs_2011_03_002 crossref_primary_10_1109_TCAD_2009_2017215 crossref_primary_10_1109_TVLSI_2008_2005311 crossref_primary_10_1007_s10703_023_00432_z crossref_primary_10_4304_jnw_6_4_662_669 crossref_primary_10_1007_s10817_005_9005_y crossref_primary_10_1007_s10009_005_0203_z crossref_primary_10_1007_s10009_002_0102_5 crossref_primary_10_1007_s10009_011_0204_z crossref_primary_10_1007_s10009_015_0403_0 crossref_primary_10_1007_s11432_016_0258_4 crossref_primary_10_1016_j_dam_2006_04_015 crossref_primary_10_1109_TCAD_2010_2049135 crossref_primary_10_1007_s10836_010_5146_y crossref_primary_10_1016_j_jfranklin_2006_01_003 crossref_primary_10_1109_TCAD_2008_925777 crossref_primary_10_3745_KIPSTD_2008_15_D_6_777 crossref_primary_10_1109_ACCESS_2023_3325616 crossref_primary_10_1109_TCAD_2008_923234 crossref_primary_10_1016_j_dam_2006_10_007 |
| Cites_doi | 10.1137/0203006 10.1109/ICCAD.1991.185225 10.1016/0004-3702(77)90029-7 10.1109/ISCAS.1994.408815 10.1007/3-540-10009-1_23 10.1145/196244.196621 10.1613/jair.1 10.1109/43.31539 10.1016/0305-0548(86)90056-0 10.1109/TEST.1991.519509 10.1109/43.536723 10.1145/321033.321034 10.1109/TEST.1992.527905 10.1109/43.238038 10.1016/0743-1066(89)90009-5 10.2307/2005469 10.1109/TAI.1993.633935 10.1109/ICCAD.1996.569607 10.1016/0004-3702(86)90080-9 10.1016/0004-3702(90)90046-3 |
| ContentType | Journal Article |
| Copyright | 1999 INIST-CNRS |
| Copyright_xml | – notice: 1999 INIST-CNRS |
| DBID | RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD F28 FR3 JQ2 L7M L~C L~D |
| DOI | 10.1109/12.769433 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database Computer and Information Systems Abstracts Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Applied Sciences |
| EndPage | 521 |
| ExternalDocumentID | 1838691 10_1109_12_769433 769433 |
| GroupedDBID | --Z -DZ -~X .55 .DC 0R~ 29I 3EH 3O- 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK ACNCT AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ MVM O9- OCL P2P PQQKQ RIA RIE RNI RNS RXW RZB TAE TN5 TWZ UHB UKR UPT VH1 X7M XJT XOL XZL YXB YYQ YZZ ZCG AAYXX CITATION IQODW RIG 7SC 7SP 8FD F28 FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c436t-701adbfbcba306778b550d4dede89c6ddda1b2f8638e96bebe13a8513fabc92f3 |
| IEDL.DBID | RIE |
| ISSN | 0018-9340 |
| IngestDate | Sun Sep 28 06:57:16 EDT 2025 Sun Sep 28 11:56:20 EDT 2025 Sat Sep 27 16:03:19 EDT 2025 Mon Jul 21 09:13:50 EDT 2025 Wed Oct 01 03:21:14 EDT 2025 Thu Apr 24 22:55:32 EDT 2025 Wed Aug 27 02:49:05 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Backtracking Software tool Experimental result Database Bench mark Search tree Artificial intelligence Conflict analysis Search algorithm |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c436t-701adbfbcba306778b550d4dede89c6ddda1b2f8638e96bebe13a8513fabc92f3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 ObjectType-Article-2 ObjectType-Feature-1 |
| PQID | 1671301219 |
| PQPubID | 23500 |
| PageCount | 16 |
| ParticipantIDs | pascalfrancis_primary_1838691 crossref_citationtrail_10_1109_12_769433 proquest_miscellaneous_26958869 proquest_miscellaneous_1671301219 crossref_primary_10_1109_12_769433 proquest_miscellaneous_28321028 ieee_primary_769433 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 1900 |
| PublicationDate | 1999-05-01 |
| PublicationDateYYYYMMDD | 1999-05-01 |
| PublicationDate_xml | – month: 05 year: 1999 text: 1999-05-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY |
| PublicationTitle | IEEE transactions on computers |
| PublicationTitleAbbrev | TC |
| PublicationYear | 1999 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers |
| References | selman (bibT050633) 1992 barth (bibT05062) 1995 marques silva (bibT050625) 1994 bibT050624 van gelder (bibT050638) 1993 ginsberg (bibT050615) 1993; 1 bibT050621 pretolani (bibT050630) 1993 bibT050620 hayes (bibT050617) 1993 bibT050629 garey (bibT050613) 1979 bibT050627 abramovici (bibT05061) 1990 dubois (bibT050610) 1993 zabih (bibT050639) 1988 sentovich (bibT050634) 1992 larrabee (bibT050622) 1990 crawford (bibT05066) 1993 bibT05063 bibT050636 bibT05068 bibT050635 bibT05069 freeman (bibT050611) 1995 bibT050612 johnson (bibT050618) 1993 bibT050632 bibT05064 bibT050631 bibT05065 bibT05067 gaschnig (bibT050614) 1979 kim (bibT050619) 1994 mallela (bibT050623) 1985 bibT050616 bibT050637 marques-silva (bibT050626) 1995 mcallester (bibT050628) 1980 |
| References_xml | – ident: bibT050637 doi: 10.1137/0203006 – ident: bibT050629 doi: 10.1109/ICCAD.1991.185225 – year: 1995 ident: bibT050611 article-title: improvements to propositional satisfiability search algorithms publication-title: ?Improvements to Propositional Satisfiability Search Algorithms ? – year: 1993 ident: bibT050630 article-title: efficiency and stability of hypergraph sat algorithms publication-title: Second DIMACS Implementation Challenge – start-page: 57 year: 1985 ident: bibT050623 article-title: a sequential circuit test generation system publication-title: Proc Int Test Conf – ident: bibT050635 doi: 10.1016/0004-3702(77)90029-7 – start-page: 155 year: 1988 ident: bibT050639 article-title: a rearrangement search strategy for determining propositional satisfiability publication-title: Proc Nat l Conf Artificial Intelligence – year: 1992 ident: bibT050633 article-title: a new method for solving hard satisfiability problems publication-title: Proc 10th Nat l Conf Artificial Intelligence (AAAI-92) – ident: bibT050624 doi: 10.1109/ISCAS.1994.408815 – year: 1993 ident: bibT050617 publication-title: Introduction to Digital Logic Design – ident: bibT05064 doi: 10.1007/3-540-10009-1_23 – start-page: 705 year: 1994 ident: bibT050625 article-title: dynamic search-space pruning techniques in path sensitization publication-title: 31st Design Automation Conference doi: 10.1145/196244.196621 – start-page: 162 year: 1994 ident: bibT050619 article-title: modgen: theorem proving by model generation publication-title: Proc 12th Nat l Conf Am Assoc Artificial Intelligence (AAAI-94) – volume: 1 start-page: 25 year: 1993 ident: bibT050615 article-title: dynamic backtracking publication-title: J Artificial Intelligence Research doi: 10.1613/jair.1 – ident: bibT050632 doi: 10.1109/43.31539 – ident: bibT05063 doi: 10.1016/0305-0548(86)90056-0 – year: 1990 ident: bibT05061 publication-title: Digital Systems Testing and Testable Design – year: 1995 ident: bibT05062 article-title: a davis-putnam based enumeration algorithm for linear pseudo-boolean optimization – ident: bibT050616 doi: 10.1109/TEST.1991.519509 – year: 1980 ident: bibT050628 article-title: an outlook on truth maintenance – year: 1993 ident: bibT050638 article-title: satisfiability testing with more reasoning and less guessing publication-title: Second DIMACS Implementation Challenge – ident: bibT050636 doi: 10.1109/43.536723 – ident: bibT05067 doi: 10.1145/321033.321034 – ident: bibT050621 doi: 10.1109/TEST.1992.527905 – year: 1979 ident: bibT050614 article-title: performance measurement and analysis of certain search algorithms publication-title: Performance measurement and analysis of certain search algorithms – ident: bibT05065 doi: 10.1109/43.238038 – start-page: 22 year: 1993 ident: bibT05066 article-title: experimental results on the cross-over point in satisfiability problems publication-title: Proc 11th Nat l Conf Artificial Intelligence (AAAI-93) – year: 1979 ident: bibT050613 publication-title: Computers and Intractability A Guide to the Theory of NP-Completeness – year: 1995 ident: bibT050626 article-title: search algorithms for satisfiability problems in combinational switching circuits publication-title: ?Search Algorithms for Satisfiability Problems in Combinational Switching Circuits ? – year: 1990 ident: bibT050622 article-title: efficient generation of test patterns using boolean satisfiability publication-title: ?Efficient Generation of Test Patterns Using Boolean Satisfiability ? – ident: bibT050612 doi: 10.1016/0743-1066(89)90009-5 – year: 1993 ident: bibT050618 publication-title: Second DIMACS Implementation Challenge – ident: bibT050620 doi: 10.2307/2005469 – ident: bibT050631 doi: 10.1109/TAI.1993.633935 – ident: bibT050627 doi: 10.1109/ICCAD.1996.569607 – year: 1993 ident: bibT050610 article-title: sat versus unsat publication-title: Second DIMACS Implementation Challenge – ident: bibT05069 doi: 10.1016/0004-3702(86)90080-9 – year: 1992 ident: bibT050634 article-title: sis: an environment to sequential circuit synthesis – ident: bibT05068 doi: 10.1016/0004-3702(90)90046-3 |
| SSID | ssj0006209 |
| Score | 2.2165973 |
| Snippet | This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 506 |
| SubjectTerms | Algorithm design and analysis Applied sciences Artificial intelligence Augmentation Automatic test pattern generation Benchmarks Circuit testing Computer science; control theory; systems Electronic design automation and methodology Exact sciences and technology Expert systems Extreme values Fault diagnosis Iterative algorithms Logic programming Logic testing Recording Search algorithms Searching |
| Title | GRASP: a search algorithm for propositional satisfiability |
| URI | https://ieeexplore.ieee.org/document/769433 https://www.proquest.com/docview/1671301219 https://www.proquest.com/docview/26958869 https://www.proquest.com/docview/28321028 |
| Volume | 48 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) issn: 0018-9340 databaseCode: RIE dateStart: 19680101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0006209 providerName: IEEE |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1RTxQxEJ4AT_ggemg8EVmJD77ssd32ui1vxIiERENUEt42nbYLBLwj3N4D_nqn7e4Jgoa3zWbadKed9pvtzDcA7ytTFQZ5kyuONhcoZI5jPc59I9G4ylbKhgTnL1_lwbE4PBmfdDzbMRfGex-Dz_woPMa7fDe18_CrbKeSWnC-DMuVkilVa7Hpyj6ag5H9clF0JEKs0DusHKWGd46eWEslREKaGSmjSVUs7m3I8ZTZX0vp27NIThiCSy5G8xZH9tdf1I2P_IBn8LRDm9leWh7PYclPBrDWV3LIOsMewJNbtITrsPv52973o93MZMkOMnN5Or0-b89-ZgRxs6tQWCGFelHfs5gecZ7ovm9ewPH-px8fD_KuxkJuBZdtXhXMOGzQouGRTA7JZXHCeeeVttI5ZxiWjSIz9VoiTTnjhlAabwxaXTb8JaxMphP_CjImLPlDmiEq6qCQmsC7FwxtxQzBQDmED736a9sRkIc6GJd1dEQKXbOyThoawvZC9CqxbjwkNAgaXgj0bzfvTOmf9oorGt0Q3vVTXJMlhesRM_HT-axmkhz2QHGnh7D1D5lS6rGibv4jEUo_EWh7_eDoNmA18T6EiMk3sNJez_0moZoW38b1_Bt5n_bq |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1RU9QwEN5BeFAfBE8dTkSq44MvPZomTRveGEc4FRhHYYa3TjZJhRHvGK73IL_eTdKeouj41ulsMukmm3zb7H4L8KrUZaaRN2nF0aQChUyxUEXqGonalqasjE9wPjyS4xPx_rQ47Xi2Qy6Mcy4En7mRfwx3-XZq5v5X2XYpleD8DqwUQogiJmsttl3Zx3MwsmAuso5GiGVqm-Wj2PTG4ROqqfhYSD0jdTSxjsUfW3I4Z_ZWYwL3LNAT-vCSr6N5iyNz_Rt5439-who86PBmshsXyENYcpMBrPa1HJLOtAdw_xdiwkews_9p9_PHnUQn0RISffFlenXenn1LCOQml760Qgz2or5nIUHiPBJ-f38MJ3tvj9-M067KQmoEl21aZkxbbNCg5oFODslpscI66yplpLVWM8ybigzVKYk06Yxrwmm80WhU3vAnsDyZTtw6JEwY8ogUQ6yog0wqgu9OMDQl0wQE5RBe9-qvTUdB7ithXNTBFclUzfI6amgILxeil5F34zahgdfwQqB_u3ljSn-2r3hFoxvCi36Ka7Ilf0GiJ246n9VMksvuSe7UELb-IpNLVVTUzT8kfPEngm1Pbx3dFtwdHx8e1Afvjj5swL3IAuHjJ5_Bcns1d5uEcVp8Htb2D4Wt-jc |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=GRASP+%3A+A+search+Algorithm+for+propositional+satisfiability&rft.jtitle=IEEE+transactions+on+computers&rft.au=MARQUES-SILVA%2C+J.+P&rft.au=SAKALLAH%2C+K.+A&rft.date=1999-05-01&rft.pub=Institute+of+Electrical+and+Electronics+Engineers&rft.issn=0018-9340&rft.volume=48&rft.issue=5&rft.spage=506&rft.epage=521&rft_id=info:doi/10.1109%2F12.769433&rft.externalDBID=n%2Fa&rft.externalDocID=1838691 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9340&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9340&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9340&client=summon |