Automated theorem proving: theory and practice
As the 21st century begins, the power of our new tool and partner, the computer, is increasing at an astonishing rate. Increasingly computers are expected to be more intelligent, to reason, to be able to draw conclusions from facts, or abstractly, to prove theorems, the subject of this book. Automat...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York [u.a.]
Springer
2001
|
| Schlagworte: | |
| Zusammenfassung: | As the 21st century begins, the power of our new tool and partner, the computer, is increasing at an astonishing rate. Increasingly computers are expected to be more intelligent, to reason, to be able to draw conclusions from facts, or abstractly, to prove theorems, the subject of this book. Automated Theorem Proving describes how this process is performed. It first introduces the mathematical language of predicate calculus and then discusses the basic inferencing rules of binary resolution and binary factoring. Using these rules, two theorem-proving systems are described. The first (HERBY) is based on constructing closed sematic trees, whereas the second (THEO) is based on the classic resolution-refutation approach. These programs are included on the accompanying CD-ROM, which includes their source code and runs on both Unix and Linux. |
| Beschreibung: | XIII, 231 S. graph. Darst. 1 CD-ROM (12 cm) |
| ISBN: | 0387950753 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV013435565 | ||
| 003 | DE-604 | ||
| 005 | 20010215 | ||
| 007 | t | ||
| 008 | 001114s2001 d||| |||| 00||| eng d | ||
| 016 | 7 | |a 960884874 |2 DE-101 | |
| 020 | |a 0387950753 |9 0-387-95075-3 | ||
| 035 | |a (OCoLC)44461999 | ||
| 035 | |a (DE-599)BVBBV013435565 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-739 |a DE-634 | ||
| 050 | 0 | |a QA76.9.A96 | |
| 082 | 0 | |a 004/.01/5113 |2 21 | |
| 084 | |a ST 285 |0 (DE-625)143648: |2 rvk | ||
| 100 | 1 | |a Newborn, Monroe |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Automated theorem proving |b theory and practice |c Monty Newborn |
| 264 | 1 | |a New York [u.a.] |b Springer |c 2001 | |
| 300 | |a XIII, 231 S. |b graph. Darst. |e 1 CD-ROM (12 cm) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a As the 21st century begins, the power of our new tool and partner, the computer, is increasing at an astonishing rate. Increasingly computers are expected to be more intelligent, to reason, to be able to draw conclusions from facts, or abstractly, to prove theorems, the subject of this book. Automated Theorem Proving describes how this process is performed. It first introduces the mathematical language of predicate calculus and then discusses the basic inferencing rules of binary resolution and binary factoring. Using these rules, two theorem-proving systems are described. The first (HERBY) is based on constructing closed sematic trees, whereas the second (THEO) is based on the classic resolution-refutation approach. These programs are included on the accompanying CD-ROM, which includes their source code and runs on both Unix and Linux. | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 0 | 7 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-009169143 | ||
Datensatz im Suchindex
| _version_ | 1804128225146699776 |
|---|---|
| any_adam_object | |
| author | Newborn, Monroe |
| author_facet | Newborn, Monroe |
| author_role | aut |
| author_sort | Newborn, Monroe |
| author_variant | m n mn |
| building | Verbundindex |
| bvnumber | BV013435565 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A96 |
| callnumber-search | QA76.9.A96 |
| callnumber-sort | QA 276.9 A96 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 285 |
| ctrlnum | (OCoLC)44461999 (DE-599)BVBBV013435565 |
| dewey-full | 004/.01/5113 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.01/5113 |
| dewey-search | 004/.01/5113 |
| dewey-sort | 14 11 45113 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01969nam a2200361 c 4500</leader><controlfield tag="001">BV013435565</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20010215 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">001114s2001 d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">960884874</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387950753</subfield><subfield code="9">0-387-95075-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)44461999</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013435565</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A96</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.01/5113</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 285</subfield><subfield code="0">(DE-625)143648:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Newborn, Monroe</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automated theorem proving</subfield><subfield code="b">theory and practice</subfield><subfield code="c">Monty Newborn</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 231 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="e">1 CD-ROM (12 cm)</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="520" ind1="3" ind2=" "><subfield code="a">As the 21st century begins, the power of our new tool and partner, the computer, is increasing at an astonishing rate. Increasingly computers are expected to be more intelligent, to reason, to be able to draw conclusions from facts, or abstractly, to prove theorems, the subject of this book. Automated Theorem Proving describes how this process is performed. It first introduces the mathematical language of predicate calculus and then discusses the basic inferencing rules of binary resolution and binary factoring. Using these rules, two theorem-proving systems are described. The first (HERBY) is based on constructing closed sematic trees, whereas the second (THEO) is based on the classic resolution-refutation approach. These programs are included on the accompanying CD-ROM, which includes their source code and runs on both Unix and Linux.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009169143</subfield></datafield></record></collection> |
| id | DE-604.BV013435565 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:45:51Z |
| institution | BVB |
| isbn | 0387950753 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009169143 |
| oclc_num | 44461999 |
| open_access_boolean | |
| owner | DE-29T DE-739 DE-634 |
| owner_facet | DE-29T DE-739 DE-634 |
| physical | XIII, 231 S. graph. Darst. 1 CD-ROM (12 cm) |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Springer |
| record_format | marc |
| spelling | Newborn, Monroe Verfasser aut Automated theorem proving theory and practice Monty Newborn New York [u.a.] Springer 2001 XIII, 231 S. graph. Darst. 1 CD-ROM (12 cm) txt rdacontent n rdamedia nc rdacarrier As the 21st century begins, the power of our new tool and partner, the computer, is increasing at an astonishing rate. Increasingly computers are expected to be more intelligent, to reason, to be able to draw conclusions from facts, or abstractly, to prove theorems, the subject of this book. Automated Theorem Proving describes how this process is performed. It first introduces the mathematical language of predicate calculus and then discusses the basic inferencing rules of binary resolution and binary factoring. Using these rules, two theorem-proving systems are described. The first (HERBY) is based on constructing closed sematic trees, whereas the second (THEO) is based on the classic resolution-refutation approach. These programs are included on the accompanying CD-ROM, which includes their source code and runs on both Unix and Linux. Automatic theorem proving Automatisches Beweisverfahren (DE-588)4069034-9 gnd rswk-swf Automatisches Beweisverfahren (DE-588)4069034-9 s DE-604 |
| spellingShingle | Newborn, Monroe Automated theorem proving theory and practice Automatic theorem proving Automatisches Beweisverfahren (DE-588)4069034-9 gnd |
| subject_GND | (DE-588)4069034-9 |
| title | Automated theorem proving theory and practice |
| title_auth | Automated theorem proving theory and practice |
| title_exact_search | Automated theorem proving theory and practice |
| title_full | Automated theorem proving theory and practice Monty Newborn |
| title_fullStr | Automated theorem proving theory and practice Monty Newborn |
| title_full_unstemmed | Automated theorem proving theory and practice Monty Newborn |
| title_short | Automated theorem proving |
| title_sort | automated theorem proving theory and practice |
| title_sub | theory and practice |
| topic | Automatic theorem proving Automatisches Beweisverfahren (DE-588)4069034-9 gnd |
| topic_facet | Automatic theorem proving Automatisches Beweisverfahren |
| work_keys_str_mv | AT newbornmonroe automatedtheoremprovingtheoryandpractice |