From logic to logic programming:
This mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn- clause logics, together with an analysis of the semantic aspects of the method. It is through the inference rule of resolut...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, Mass.
MIT Press
©1994
|
| Schriftenreihe: | Foundations of computing
|
| Links: | https://doi.org/10.7551/mitpress/3133.001.0001?locatt=mode:legacy |
| Zusammenfassung: | This mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn- clause logics, together with an analysis of the semantic aspects of the method. It is through the inference rule of resolution that both proofs and computations can be manipulated on computers, and this book contains elegant versions and proofs of the fundamental theorems and lemmas in the proof theory of logic programming. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and streamlined setups for SLD- and SLDNF-resolution are described. No other book treats this material in such detail and with such sophistication. Doets provides a novel approach to resolution that is applied to the first-order case and the case of (positive) logic programs. In contrast to the usual approach, the concept of a resolvent is defined nonconstructively, without recourse to the concept of unification, allowing the soundness and completeness proofs to be carried out in a more economic way. Other new material includes computability results dealing with analytical hierarchy, results on infinite derivations and an exposition on general logic programs using 3-valued logic. |
| Umfang: | 1 Online-Ressource (xii, 214 Seiten) Illustrationen |
| ISBN: | 0262288478 9780262288477 |
Internformat
MARC
| LEADER | 00000cam a2200000Ka 4500 | ||
|---|---|---|---|
| 001 | ZDB-260-MPOB-3133 | ||
| 003 | MaCbMITP | ||
| 005 | 20190503073409.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 130208s1994 maua ob 011 0 eng d | ||
| 020 | |a 0262288478 | ||
| 020 | |a 9780262288477 | ||
| 100 | 1 | |a Doets, Kees | |
| 245 | 1 | 0 | |a From logic to logic programming |c Kees Doets |
| 264 | 1 | |a Cambridge, Mass. |b MIT Press |c ©1994 | |
| 300 | |a 1 Online-Ressource (xii, 214 Seiten) |b Illustrationen | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 490 | 1 | |a Foundations of computing | |
| 520 | |a This mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn- clause logics, together with an analysis of the semantic aspects of the method. It is through the inference rule of resolution that both proofs and computations can be manipulated on computers, and this book contains elegant versions and proofs of the fundamental theorems and lemmas in the proof theory of logic programming. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and streamlined setups for SLD- and SLDNF-resolution are described. No other book treats this material in such detail and with such sophistication. Doets provides a novel approach to resolution that is applied to the first-order case and the case of (positive) logic programs. In contrast to the usual approach, the concept of a resolvent is defined nonconstructively, without recourse to the concept of unification, allowing the soundness and completeness proofs to be carried out in a more economic way. Other new material includes computability results dealing with analytical hierarchy, results on infinite derivations and an exposition on general logic programs using 3-valued logic. | ||
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 0262041421 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780262041423 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-260-MPOB |q TUM_PDA_MPOB |3 MIT Press |u https://doi.org/10.7551/mitpress/3133.001.0001?locatt=mode:legacy |3 Volltext |
| 912 | |a ZDB-260-MPOB | ||
| 912 | |a ZDB-260-MPOB | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-260-MPOB-3133 |
|---|---|
| _version_ | 1821493840120381441 |
| adam_text | |
| any_adam_object | |
| author | Doets, Kees |
| author_facet | Doets, Kees |
| author_role | |
| author_sort | Doets, Kees |
| author_variant | k d kd |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-260-MPOB |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02125cam a2200277Ka 4500</leader><controlfield tag="001">ZDB-260-MPOB-3133</controlfield><controlfield tag="003">MaCbMITP</controlfield><controlfield tag="005">20190503073409.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">130208s1994 maua ob 011 0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262288478</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262288477</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Doets, Kees</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">From logic to logic programming</subfield><subfield code="c">Kees Doets</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">MIT Press</subfield><subfield code="c">©1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xii, 214 Seiten)</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Foundations of computing</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn- clause logics, together with an analysis of the semantic aspects of the method. It is through the inference rule of resolution that both proofs and computations can be manipulated on computers, and this book contains elegant versions and proofs of the fundamental theorems and lemmas in the proof theory of logic programming. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and streamlined setups for SLD- and SLDNF-resolution are described. No other book treats this material in such detail and with such sophistication. Doets provides a novel approach to resolution that is applied to the first-order case and the case of (positive) logic programs. In contrast to the usual approach, the concept of a resolvent is defined nonconstructively, without recourse to the concept of unification, allowing the soundness and completeness proofs to be carried out in a more economic way. Other new material includes computability results dealing with analytical hierarchy, results on infinite derivations and an exposition on general logic programs using 3-valued logic.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">0262041421</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780262041423</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-260-MPOB</subfield><subfield code="q">TUM_PDA_MPOB</subfield><subfield code="3">MIT Press</subfield><subfield code="u">https://doi.org/10.7551/mitpress/3133.001.0001?locatt=mode:legacy</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-260-MPOB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-260-MPOB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-260-MPOB-3133 |
| illustrated | Illustrated |
| indexdate | 2025-01-17T11:04:52Z |
| institution | BVB |
| isbn | 0262288478 9780262288477 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xii, 214 Seiten) Illustrationen |
| psigel | ZDB-260-MPOB TUM_PDA_MPOB ZDB-260-MPOB |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | MIT Press |
| record_format | marc |
| series2 | Foundations of computing |
| spelling | Doets, Kees From logic to logic programming Kees Doets Cambridge, Mass. MIT Press ©1994 1 Online-Ressource (xii, 214 Seiten) Illustrationen txt c cr Foundations of computing This mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn- clause logics, together with an analysis of the semantic aspects of the method. It is through the inference rule of resolution that both proofs and computations can be manipulated on computers, and this book contains elegant versions and proofs of the fundamental theorems and lemmas in the proof theory of logic programming. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and streamlined setups for SLD- and SLDNF-resolution are described. No other book treats this material in such detail and with such sophistication. Doets provides a novel approach to resolution that is applied to the first-order case and the case of (positive) logic programs. In contrast to the usual approach, the concept of a resolvent is defined nonconstructively, without recourse to the concept of unification, allowing the soundness and completeness proofs to be carried out in a more economic way. Other new material includes computability results dealing with analytical hierarchy, results on infinite derivations and an exposition on general logic programs using 3-valued logic. Erscheint auch als Druck-Ausgabe 0262041421 Erscheint auch als Druck-Ausgabe 9780262041423 |
| spellingShingle | Doets, Kees From logic to logic programming |
| title | From logic to logic programming |
| title_auth | From logic to logic programming |
| title_exact_search | From logic to logic programming |
| title_full | From logic to logic programming Kees Doets |
| title_fullStr | From logic to logic programming Kees Doets |
| title_full_unstemmed | From logic to logic programming Kees Doets |
| title_short | From logic to logic programming |
| title_sort | from logic to logic programming |
| work_keys_str_mv | AT doetskees fromlogictologicprogramming |