Weighted graphs, tool for studying the halting problem and time complexity in term rewriting systems and logic programming:
Abstract: "This study is based on the halting and complexity problems for a simple class of logic programs in PROLOG-like languages. Any Prolog program can be expressed in the form of an overlap of some simpler programs whose structures are basic and can be studied formally. The simplext recurs...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1988
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
437 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This study is based on the halting and complexity problems for a simple class of logic programs in PROLOG-like languages. Any Prolog program can be expressed in the form of an overlap of some simpler programs whose structures are basic and can be studied formally. The simplext recursive rules are studied here and the weighted graph is introduced to characterise their behaviour. This new syntactic object, the weighted graph, generalises the directed graph. Unfoldings of directed graphs generate infinite regular trees that I generalise by weighting the arrows and putting periods on the variables. The weights along a branch are added during unfolding and the result (modulo of the period) indexes variables. Hence, their interpretations are non-regular trees because of the infinity of variables. This paper presents some of the formal properties of these graphs, finite and infinite interpretation and unification Although they have a consistency apart from all possible applications, weighted graphs characterise the behaviour of recursive rules in the form L : -R. They express the most general fixpoint of these rules and range across a finite sequence of recursive rewritings. Within global rewriting systems, narrowing and logic programming, the halting problem and the existence of solutions are proved to be decidable for this simple recursive rule with linear goals and facts, and the complexity is shown to be at most linear. Although thse problems are undecidable for slightly more complex schemes, it is hoped that from weighted graphs of each recursive sub-structure of a Prolog program, the whole behaviour of the program will be understandable. Then, the weighted graphs would be the nucleus of an efficient and methodological logic programming, which could be called, Structured Logic Programming. |
| Beschreibung: | 59 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010946864 | ||
| 003 | DE-604 | ||
| 005 | 19961007 | ||
| 007 | t | ||
| 008 | 960912s1988 d||| |||| 00||| engod | ||
| 035 | |a (OCoLC)20839443 | ||
| 035 | |a (DE-599)BVBBV010946864 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Devienne, Philippe |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Weighted graphs, tool for studying the halting problem and time complexity in term rewriting systems and logic programming |c by P. Devienne |
| 264 | 1 | |a Tokyo, Japan |c 1988 | |
| 300 | |a 59 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 437 | |
| 520 | 3 | |a Abstract: "This study is based on the halting and complexity problems for a simple class of logic programs in PROLOG-like languages. Any Prolog program can be expressed in the form of an overlap of some simpler programs whose structures are basic and can be studied formally. The simplext recursive rules are studied here and the weighted graph is introduced to characterise their behaviour. This new syntactic object, the weighted graph, generalises the directed graph. Unfoldings of directed graphs generate infinite regular trees that I generalise by weighting the arrows and putting periods on the variables. The weights along a branch are added during unfolding and the result (modulo of the period) indexes variables. Hence, their interpretations are non-regular trees because of the infinity of variables. This paper presents some of the formal properties of these graphs, finite and infinite interpretation and unification | |
| 520 | 3 | |a Although they have a consistency apart from all possible applications, weighted graphs characterise the behaviour of recursive rules in the form L : -R. They express the most general fixpoint of these rules and range across a finite sequence of recursive rewritings. Within global rewriting systems, narrowing and logic programming, the halting problem and the existence of solutions are proved to be decidable for this simple recursive rule with linear goals and facts, and the complexity is shown to be at most linear. Although thse problems are undecidable for slightly more complex schemes, it is hoped that from weighted graphs of each recursive sub-structure of a Prolog program, the whole behaviour of the program will be understandable. Then, the weighted graphs would be the nucleus of an efficient and methodological logic programming, which could be called, Structured Logic Programming. | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Directed graphs | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 437 |w (DE-604)BV010923438 |9 437 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007321118 | ||
Datensatz im Suchindex
| _version_ | 1804125433436831744 |
|---|---|
| any_adam_object | |
| author | Devienne, Philippe |
| author_facet | Devienne, Philippe |
| author_role | aut |
| author_sort | Devienne, Philippe |
| author_variant | p d pd |
| building | Verbundindex |
| bvnumber | BV010946864 |
| ctrlnum | (OCoLC)20839443 (DE-599)BVBBV010946864 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02981nam a2200337 cb4500</leader><controlfield tag="001">BV010946864</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19961007 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960912s1988 d||| |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20839443</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010946864</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">Devienne, Philippe</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Weighted graphs, tool for studying the halting problem and time complexity in term rewriting systems and logic programming</subfield><subfield code="c">by P. Devienne</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">59 S.</subfield><subfield code="b">graph. Darst.</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">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">437</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This study is based on the halting and complexity problems for a simple class of logic programs in PROLOG-like languages. Any Prolog program can be expressed in the form of an overlap of some simpler programs whose structures are basic and can be studied formally. The simplext recursive rules are studied here and the weighted graph is introduced to characterise their behaviour. This new syntactic object, the weighted graph, generalises the directed graph. Unfoldings of directed graphs generate infinite regular trees that I generalise by weighting the arrows and putting periods on the variables. The weights along a branch are added during unfolding and the result (modulo of the period) indexes variables. Hence, their interpretations are non-regular trees because of the infinity of variables. This paper presents some of the formal properties of these graphs, finite and infinite interpretation and unification</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Although they have a consistency apart from all possible applications, weighted graphs characterise the behaviour of recursive rules in the form L : -R. They express the most general fixpoint of these rules and range across a finite sequence of recursive rewritings. Within global rewriting systems, narrowing and logic programming, the halting problem and the existence of solutions are proved to be decidable for this simple recursive rule with linear goals and facts, and the complexity is shown to be at most linear. Although thse problems are undecidable for slightly more complex schemes, it is hoped that from weighted graphs of each recursive sub-structure of a Prolog program, the whole behaviour of the program will be understandable. Then, the weighted graphs would be the nucleus of an efficient and methodological logic programming, which could be called, Structured Logic Programming.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Directed graphs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">437</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">437</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007321118</subfield></datafield></record></collection> |
| id | DE-604.BV010946864 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:01:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007321118 |
| oclc_num | 20839443 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 59 S. graph. Darst. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spelling | Devienne, Philippe Verfasser aut Weighted graphs, tool for studying the halting problem and time complexity in term rewriting systems and logic programming by P. Devienne Tokyo, Japan 1988 59 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 437 Abstract: "This study is based on the halting and complexity problems for a simple class of logic programs in PROLOG-like languages. Any Prolog program can be expressed in the form of an overlap of some simpler programs whose structures are basic and can be studied formally. The simplext recursive rules are studied here and the weighted graph is introduced to characterise their behaviour. This new syntactic object, the weighted graph, generalises the directed graph. Unfoldings of directed graphs generate infinite regular trees that I generalise by weighting the arrows and putting periods on the variables. The weights along a branch are added during unfolding and the result (modulo of the period) indexes variables. Hence, their interpretations are non-regular trees because of the infinity of variables. This paper presents some of the formal properties of these graphs, finite and infinite interpretation and unification Although they have a consistency apart from all possible applications, weighted graphs characterise the behaviour of recursive rules in the form L : -R. They express the most general fixpoint of these rules and range across a finite sequence of recursive rewritings. Within global rewriting systems, narrowing and logic programming, the halting problem and the existence of solutions are proved to be decidable for this simple recursive rule with linear goals and facts, and the complexity is shown to be at most linear. Although thse problems are undecidable for slightly more complex schemes, it is hoped that from weighted graphs of each recursive sub-structure of a Prolog program, the whole behaviour of the program will be understandable. Then, the weighted graphs would be the nucleus of an efficient and methodological logic programming, which could be called, Structured Logic Programming. Computational complexity Directed graphs Logic programming Rewriting systems (Computer science) Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 437 (DE-604)BV010923438 437 |
| spellingShingle | Devienne, Philippe Weighted graphs, tool for studying the halting problem and time complexity in term rewriting systems and logic programming Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Computational complexity Directed graphs Logic programming Rewriting systems (Computer science) |
| title | Weighted graphs, tool for studying the halting problem and time complexity in term rewriting systems and logic programming |
| title_auth | Weighted graphs, tool for studying the halting problem and time complexity in term rewriting systems and logic programming |
| title_exact_search | Weighted graphs, tool for studying the halting problem and time complexity in term rewriting systems and logic programming |
| title_full | Weighted graphs, tool for studying the halting problem and time complexity in term rewriting systems and logic programming by P. Devienne |
| title_fullStr | Weighted graphs, tool for studying the halting problem and time complexity in term rewriting systems and logic programming by P. Devienne |
| title_full_unstemmed | Weighted graphs, tool for studying the halting problem and time complexity in term rewriting systems and logic programming by P. Devienne |
| title_short | Weighted graphs, tool for studying the halting problem and time complexity in term rewriting systems and logic programming |
| title_sort | weighted graphs tool for studying the halting problem and time complexity in term rewriting systems and logic programming |
| topic | Computational complexity Directed graphs Logic programming Rewriting systems (Computer science) |
| topic_facet | Computational complexity Directed graphs Logic programming Rewriting systems (Computer science) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT deviennephilippe weightedgraphstoolforstudyingthehaltingproblemandtimecomplexityintermrewritingsystemsandlogicprogramming |