Towards an understanding of hill-climbing procedures for SAT:
Abstract: "Recently several local hill-climbing procedures for propositional satisfiability have been proposed, which are able to solve large and difficult problems beyond the reach of conventional algorithms like Davis-Putnam. By the introduction of some new variants of these procedures, we pr...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1993
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
614 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Recently several local hill-climbing procedures for propositional satisfiability have been proposed, which are able to solve large and difficult problems beyond the reach of conventional algorithms like Davis-Putnam. By the introduction of some new variants of these procedures, we provide strong experimental evidence to support the conjecture that neither greediness nor randomness is important in these procedures. One of the variants introduced seems to offer significant improvements over earlier procedures. In addition, we investigate experimentally how their performance depends on their parameters. Our results suggest that run-time scales less than simply exponentially in the problem size." |
| Beschreibung: | 14 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010460959 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951102s1993 |||| 00||| engod | ||
| 035 | |a (OCoLC)31223366 | ||
| 035 | |a (DE-599)BVBBV010460959 | ||
| 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 Towards an understanding of hill-climbing procedures for SAT |c Ian P. Gent ; Toby Walsh |
| 264 | 1 | |a Edinburgh |c 1993 | |
| 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 614 | |
| 520 | 3 | |a Abstract: "Recently several local hill-climbing procedures for propositional satisfiability have been proposed, which are able to solve large and difficult problems beyond the reach of conventional algorithms like Davis-Putnam. By the introduction of some new variants of these procedures, we provide strong experimental evidence to support the conjecture that neither greediness nor randomness is important in these procedures. One of the variants introduced seems to offer significant improvements over earlier procedures. In addition, we investigate experimentally how their performance depends on their parameters. Our results suggest that run-time scales less than simply exponentially in the problem size." | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Artificial intelligence | |
| 700 | 1 | |a Walsh, Toby |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 614 |w (DE-604)BV010450646 |9 614 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006969713 | ||
Datensatz im Suchindex
| _version_ | 1804124892299264000 |
|---|---|
| any_adam_object | |
| author | Gent, Ian P. Walsh, Toby |
| author_facet | Gent, Ian P. Walsh, Toby |
| author_role | aut aut |
| author_sort | Gent, Ian P. |
| author_variant | i p g ip ipg t w tw |
| building | Verbundindex |
| bvnumber | BV010460959 |
| ctrlnum | (OCoLC)31223366 (DE-599)BVBBV010460959 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01809nam a2200337 cb4500</leader><controlfield tag="001">BV010460959</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951102s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31223366</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010460959</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">Towards an understanding of hill-climbing procedures for SAT</subfield><subfield code="c">Ian P. Gent ; Toby Walsh</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1993</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">614</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Recently several local hill-climbing procedures for propositional satisfiability have been proposed, which are able to solve large and difficult problems beyond the reach of conventional algorithms like Davis-Putnam. By the introduction of some new variants of these procedures, we provide strong experimental evidence to support the conjecture that neither greediness nor randomness is important in these procedures. One of the variants introduced seems to offer significant improvements over earlier procedures. In addition, we investigate experimentally how their performance depends on their parameters. Our results suggest that run-time scales less than simply exponentially in the problem size."</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="700" ind1="1" ind2=" "><subfield code="a">Walsh, Toby</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">614</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">614</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006969713</subfield></datafield></record></collection> |
| id | DE-604.BV010460959 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:53Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006969713 |
| oclc_num | 31223366 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 14 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Gent, Ian P. Verfasser aut Towards an understanding of hill-climbing procedures for SAT Ian P. Gent ; Toby Walsh Edinburgh 1993 14 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 614 Abstract: "Recently several local hill-climbing procedures for propositional satisfiability have been proposed, which are able to solve large and difficult problems beyond the reach of conventional algorithms like Davis-Putnam. By the introduction of some new variants of these procedures, we provide strong experimental evidence to support the conjecture that neither greediness nor randomness is important in these procedures. One of the variants introduced seems to offer significant improvements over earlier procedures. In addition, we investigate experimentally how their performance depends on their parameters. Our results suggest that run-time scales less than simply exponentially in the problem size." Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence Walsh, Toby Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 614 (DE-604)BV010450646 614 |
| spellingShingle | Gent, Ian P. Walsh, Toby Towards an understanding of hill-climbing procedures for SAT Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence |
| title | Towards an understanding of hill-climbing procedures for SAT |
| title_auth | Towards an understanding of hill-climbing procedures for SAT |
| title_exact_search | Towards an understanding of hill-climbing procedures for SAT |
| title_full | Towards an understanding of hill-climbing procedures for SAT Ian P. Gent ; Toby Walsh |
| title_fullStr | Towards an understanding of hill-climbing procedures for SAT Ian P. Gent ; Toby Walsh |
| title_full_unstemmed | Towards an understanding of hill-climbing procedures for SAT Ian P. Gent ; Toby Walsh |
| title_short | Towards an understanding of hill-climbing procedures for SAT |
| title_sort | towards an understanding of hill climbing procedures for sat |
| topic | Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence |
| topic_facet | Mathematics Künstliche Intelligenz Mathematik Artificial intelligence |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT gentianp towardsanunderstandingofhillclimbingproceduresforsat AT walshtoby towardsanunderstandingofhillclimbingproceduresforsat |