Proving run-time properties of general programs w.r.t. constructive negation:
Abstract: "In these notes we study run-time properties of general programs w.r.t. constructive negation, i.e. termination and properties of the form of the arguments of the literals selected during the execution. We consider here SLD-CNF resolution, i.e. resolution with constructive negation an...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1992
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
92,45 |
| Subjects: | |
| Summary: | Abstract: "In these notes we study run-time properties of general programs w.r.t. constructive negation, i.e. termination and properties of the form of the arguments of the literals selected during the execution. We consider here SLD-CNF resolution, i.e. resolution with constructive negation and arbitrary selection rule, and LD-CNF resolution, i.e. resolution with constructive negation and Prolog selection rule. We show that the class of programs which terminate for all ground goals for arbitrary (resp. Prolog) selection rule coincides with the so-called acyclic (resp. acceptable) programs, and that SLD-CNF (resp. LD-CNF) resolution is sound and complete w.r.t. Clark's semantics for bounded goals and acyclic (resp. acceptable) programs These results are applied to the study of run-time properties of general programs: two proof methods are introduced and their soundness is proven respectively w.r.t. SLD-CNF and LD-CNF resolution. |
| Physical Description: | 28 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009015832 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)28982003 | ||
| 035 | |a (DE-599)BVBBV009015832 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Marchiori, Elena |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Proving run-time properties of general programs w.r.t. constructive negation |c Elena Marchiori |
| 264 | 1 | |a Amsterdam |c 1992 | |
| 300 | |a 28 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 92,45 | |
| 520 | 3 | |a Abstract: "In these notes we study run-time properties of general programs w.r.t. constructive negation, i.e. termination and properties of the form of the arguments of the literals selected during the execution. We consider here SLD-CNF resolution, i.e. resolution with constructive negation and arbitrary selection rule, and LD-CNF resolution, i.e. resolution with constructive negation and Prolog selection rule. We show that the class of programs which terminate for all ground goals for arbitrary (resp. Prolog) selection rule coincides with the so-called acyclic (resp. acceptable) programs, and that SLD-CNF (resp. LD-CNF) resolution is sound and complete w.r.t. Clark's semantics for bounded goals and acyclic (resp. acceptable) programs | |
| 520 | 3 | |a These results are applied to the study of run-time properties of general programs: two proof methods are introduced and their soundness is proven respectively w.r.t. SLD-CNF and LD-CNF resolution. | |
| 650 | 4 | |a Logic programming | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 92,45 |w (DE-604)BV008928356 |9 92,45 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005961362 | ||
Record in the Search Index
| _version_ | 1804123365191974912 |
|---|---|
| any_adam_object | |
| author | Marchiori, Elena |
| author_facet | Marchiori, Elena |
| author_role | aut |
| author_sort | Marchiori, Elena |
| author_variant | e m em |
| building | Verbundindex |
| bvnumber | BV009015832 |
| ctrlnum | (OCoLC)28982003 (DE-599)BVBBV009015832 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01940nam a2200301 cb4500</leader><controlfield tag="001">BV009015832</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28982003</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009015832</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Marchiori, Elena</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proving run-time properties of general programs w.r.t. constructive negation</subfield><subfield code="c">Elena Marchiori</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">28 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">92,45</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In these notes we study run-time properties of general programs w.r.t. constructive negation, i.e. termination and properties of the form of the arguments of the literals selected during the execution. We consider here SLD-CNF resolution, i.e. resolution with constructive negation and arbitrary selection rule, and LD-CNF resolution, i.e. resolution with constructive negation and Prolog selection rule. We show that the class of programs which terminate for all ground goals for arbitrary (resp. Prolog) selection rule coincides with the so-called acyclic (resp. acceptable) programs, and that SLD-CNF (resp. LD-CNF) resolution is sound and complete w.r.t. Clark's semantics for bounded goals and acyclic (resp. acceptable) programs</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">These results are applied to the study of run-time properties of general programs: two proof methods are introduced and their soundness is proven respectively w.r.t. SLD-CNF and LD-CNF resolution.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">92,45</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">92,45</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005961362</subfield></datafield></record></collection> |
| id | DE-604.BV009015832 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005961362 |
| oclc_num | 28982003 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 28 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Marchiori, Elena Verfasser aut Proving run-time properties of general programs w.r.t. constructive negation Elena Marchiori Amsterdam 1992 28 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,45 Abstract: "In these notes we study run-time properties of general programs w.r.t. constructive negation, i.e. termination and properties of the form of the arguments of the literals selected during the execution. We consider here SLD-CNF resolution, i.e. resolution with constructive negation and arbitrary selection rule, and LD-CNF resolution, i.e. resolution with constructive negation and Prolog selection rule. We show that the class of programs which terminate for all ground goals for arbitrary (resp. Prolog) selection rule coincides with the so-called acyclic (resp. acceptable) programs, and that SLD-CNF (resp. LD-CNF) resolution is sound and complete w.r.t. Clark's semantics for bounded goals and acyclic (resp. acceptable) programs These results are applied to the study of run-time properties of general programs: two proof methods are introduced and their soundness is proven respectively w.r.t. SLD-CNF and LD-CNF resolution. Logic programming Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 92,45 (DE-604)BV008928356 92,45 |
| spellingShingle | Marchiori, Elena Proving run-time properties of general programs w.r.t. constructive negation Logic programming |
| title | Proving run-time properties of general programs w.r.t. constructive negation |
| title_auth | Proving run-time properties of general programs w.r.t. constructive negation |
| title_exact_search | Proving run-time properties of general programs w.r.t. constructive negation |
| title_full | Proving run-time properties of general programs w.r.t. constructive negation Elena Marchiori |
| title_fullStr | Proving run-time properties of general programs w.r.t. constructive negation Elena Marchiori |
| title_full_unstemmed | Proving run-time properties of general programs w.r.t. constructive negation Elena Marchiori |
| title_short | Proving run-time properties of general programs w.r.t. constructive negation |
| title_sort | proving run time properties of general programs w r t constructive negation |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT marchiorielena provingruntimepropertiesofgeneralprogramswrtconstructivenegation |