The enigma of SAT hill-climbing procedures:
Abstract: "In this paper, we investigate a family of hill- climbing procedures related to GSAT, a greedy random hill-climbing procedure for satisfiability. These procedures are able to solve large and difficult satisfiability problems beyond the range of conventional procedures like Davis-Putna...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1992
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
605 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this paper, we investigate a family of hill- climbing procedures related to GSAT, a greedy random hill-climbing procedure for satisfiability. These procedures are able to solve large and difficult satisfiability problems beyond the range of conventional procedures like Davis-Putnam. We explore the role of greediness, randomness, and hill-climbing in the effectiveness of these procedures. We show that neither greediness nor randomness is crucial to GSAT's performance, and that hill-climbing's importance is limited to a short initial phase of search. In addition, we observe some remarkable and possibly universal features of their search for a satisfying truth assignment." |
| Beschreibung: | 14 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010460860 | ||
| 003 | DE-604 | ||
| 005 | 19951102 | ||
| 007 | t | ||
| 008 | 951102s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)31223361 | ||
| 035 | |a (DE-599)BVBBV010460860 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Gent, Ian P. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The enigma of SAT hill-climbing procedures |
| 264 | 1 | |a Edinburgh |c 1992 | |
| 300 | |a 14 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 605 | |
| 520 | 3 | |a Abstract: "In this paper, we investigate a family of hill- climbing procedures related to GSAT, a greedy random hill-climbing procedure for satisfiability. These procedures are able to solve large and difficult satisfiability problems beyond the range of conventional procedures like Davis-Putnam. We explore the role of greediness, randomness, and hill-climbing in the effectiveness of these procedures. We show that neither greediness nor randomness is crucial to GSAT's performance, and that hill-climbing's importance is limited to a short initial phase of search. In addition, we observe some remarkable and possibly universal features of their search for a satisfying truth assignment." | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a NP-complete problems | |
| 700 | 0 | |a Walsh |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 605 |w (DE-604)BV010450646 |9 605 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006969631 | ||
Datensatz im Suchindex
| _version_ | 1804124892175532032 |
|---|---|
| any_adam_object | |
| author | Gent, Ian P. Walsh |
| author_facet | Gent, Ian P. Walsh |
| author_role | aut aut |
| author_sort | Gent, Ian P. |
| author_variant | i p g ip ipg w |
| building | Verbundindex |
| bvnumber | BV010460860 |
| ctrlnum | (OCoLC)31223361 (DE-599)BVBBV010460860 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01780nam a2200349 cb4500</leader><controlfield tag="001">BV010460860</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19951102 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951102s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31223361</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010460860</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gent, Ian P.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The enigma of SAT hill-climbing procedures</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">605</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper, we investigate a family of hill- climbing procedures related to GSAT, a greedy random hill-climbing procedure for satisfiability. These procedures are able to solve large and difficult satisfiability problems beyond the range of conventional procedures like Davis-Putnam. We explore the role of greediness, randomness, and hill-climbing in the effectiveness of these procedures. We show that neither greediness nor randomness is crucial to GSAT's performance, and that hill-climbing's importance is limited to a short initial phase of search. In addition, we observe some remarkable and possibly universal features of their search for a satisfying truth assignment."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">NP-complete problems</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Walsh</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">605</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">605</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006969631</subfield></datafield></record></collection> |
| id | DE-604.BV010460860 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:53Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006969631 |
| oclc_num | 31223361 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 14 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Gent, Ian P. Verfasser aut The enigma of SAT hill-climbing procedures Edinburgh 1992 14 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 605 Abstract: "In this paper, we investigate a family of hill- climbing procedures related to GSAT, a greedy random hill-climbing procedure for satisfiability. These procedures are able to solve large and difficult satisfiability problems beyond the range of conventional procedures like Davis-Putnam. We explore the role of greediness, randomness, and hill-climbing in the effectiveness of these procedures. We show that neither greediness nor randomness is crucial to GSAT's performance, and that hill-climbing's importance is limited to a short initial phase of search. In addition, we observe some remarkable and possibly universal features of their search for a satisfying truth assignment." Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence NP-complete problems Walsh Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 605 (DE-604)BV010450646 605 |
| spellingShingle | Gent, Ian P. Walsh The enigma of SAT hill-climbing procedures Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence NP-complete problems |
| title | The enigma of SAT hill-climbing procedures |
| title_auth | The enigma of SAT hill-climbing procedures |
| title_exact_search | The enigma of SAT hill-climbing procedures |
| title_full | The enigma of SAT hill-climbing procedures |
| title_fullStr | The enigma of SAT hill-climbing procedures |
| title_full_unstemmed | The enigma of SAT hill-climbing procedures |
| title_short | The enigma of SAT hill-climbing procedures |
| title_sort | the enigma of sat hill climbing procedures |
| topic | Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence NP-complete problems |
| topic_facet | Mathematics Künstliche Intelligenz Mathematik Artificial intelligence NP-complete problems |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT gentianp theenigmaofsathillclimbingprocedures AT walsh theenigmaofsathillclimbingprocedures |