Stable theories for logic programs:
Abstract: "We define a class of theories associated to any normal logic program, called stable theories, based on a notion of stable negative hypotheses. This stability of hypotheses is motivated directly from the intuitive understanding of negation by failure. We study how stable theories gene...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Pisa
1991
|
| Series: | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report
1991,18 |
| Subjects: | |
| Summary: | Abstract: "We define a class of theories associated to any normal logic program, called stable theories, based on a notion of stable negative hypotheses. This stability of hypotheses is motivated directly from the intuitive understanding of negation by failure. We study how stable theories generalize stable models and show that every logic program has at least one stable theory associated to it. Also the same basic ideas allow us to identify a unique theory that defines a 'minimal' semantics for logic programs analogous to the well-founded model semantics. This provides a uniform framework that accommodates these two different semantics of stable and well-founded model [sic] and clarifies further their relationship." |
| Physical Description: | 22 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010848067 | ||
| 003 | DE-604 | ||
| 005 | 20090805 | ||
| 007 | t | ||
| 008 | 960712s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)28227695 | ||
| 035 | |a (DE-599)BVBBV010848067 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Kakas, Antonis C. |d 1957- |e Verfasser |0 (DE-588)123879485 |4 aut | |
| 245 | 1 | 0 | |a Stable theories for logic programs |c A. C. Kakas ; P. Mancarella |
| 264 | 1 | |a Pisa |c 1991 | |
| 300 | |a 22 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |v 1991,18 | |
| 520 | 3 | |a Abstract: "We define a class of theories associated to any normal logic program, called stable theories, based on a notion of stable negative hypotheses. This stability of hypotheses is motivated directly from the intuitive understanding of negation by failure. We study how stable theories generalize stable models and show that every logic program has at least one stable theory associated to it. Also the same basic ideas allow us to identify a unique theory that defines a 'minimal' semantics for logic programs analogous to the well-founded model semantics. This provides a uniform framework that accommodates these two different semantics of stable and well-founded model [sic] and clarifies further their relationship." | |
| 650 | 4 | |a Logic programming | |
| 700 | 1 | |a Mancarella, Paolo |e Verfasser |4 aut | |
| 810 | 2 | |a Dipartimento di Informatica: Technical report |t Università degli Studi <Pisa> |v 1991,18 |w (DE-604)BV010841375 |9 1991,18 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007250717 | ||
Record in the Search Index
| _version_ | 1804125333983592448 |
|---|---|
| any_adam_object | |
| author | Kakas, Antonis C. 1957- Mancarella, Paolo |
| author_GND | (DE-588)123879485 |
| author_facet | Kakas, Antonis C. 1957- Mancarella, Paolo |
| author_role | aut aut |
| author_sort | Kakas, Antonis C. 1957- |
| author_variant | a c k ac ack p m pm |
| building | Verbundindex |
| bvnumber | BV010848067 |
| ctrlnum | (OCoLC)28227695 (DE-599)BVBBV010848067 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01728nam a2200301 cb4500</leader><controlfield tag="001">BV010848067</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090805 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960712s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28227695</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010848067</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">Kakas, Antonis C.</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123879485</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Stable theories for logic programs</subfield><subfield code="c">A. C. Kakas ; P. Mancarella</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pisa</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22 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">Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report</subfield><subfield code="v">1991,18</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We define a class of theories associated to any normal logic program, called stable theories, based on a notion of stable negative hypotheses. This stability of hypotheses is motivated directly from the intuitive understanding of negation by failure. We study how stable theories generalize stable models and show that every logic program has at least one stable theory associated to it. Also the same basic ideas allow us to identify a unique theory that defines a 'minimal' semantics for logic programs analogous to the well-founded model semantics. This provides a uniform framework that accommodates these two different semantics of stable and well-founded model [sic] and clarifies further their relationship."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mancarella, Paolo</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Dipartimento di Informatica: Technical report</subfield><subfield code="t">Università degli Studi <Pisa></subfield><subfield code="v">1991,18</subfield><subfield code="w">(DE-604)BV010841375</subfield><subfield code="9">1991,18</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007250717</subfield></datafield></record></collection> |
| id | DE-604.BV010848067 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:59:54Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007250717 |
| oclc_num | 28227695 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 22 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |
| spelling | Kakas, Antonis C. 1957- Verfasser (DE-588)123879485 aut Stable theories for logic programs A. C. Kakas ; P. Mancarella Pisa 1991 22 S. txt rdacontent n rdamedia nc rdacarrier Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report 1991,18 Abstract: "We define a class of theories associated to any normal logic program, called stable theories, based on a notion of stable negative hypotheses. This stability of hypotheses is motivated directly from the intuitive understanding of negation by failure. We study how stable theories generalize stable models and show that every logic program has at least one stable theory associated to it. Also the same basic ideas allow us to identify a unique theory that defines a 'minimal' semantics for logic programs analogous to the well-founded model semantics. This provides a uniform framework that accommodates these two different semantics of stable and well-founded model [sic] and clarifies further their relationship." Logic programming Mancarella, Paolo Verfasser aut Dipartimento di Informatica: Technical report Università degli Studi <Pisa> 1991,18 (DE-604)BV010841375 1991,18 |
| spellingShingle | Kakas, Antonis C. 1957- Mancarella, Paolo Stable theories for logic programs Logic programming |
| title | Stable theories for logic programs |
| title_auth | Stable theories for logic programs |
| title_exact_search | Stable theories for logic programs |
| title_full | Stable theories for logic programs A. C. Kakas ; P. Mancarella |
| title_fullStr | Stable theories for logic programs A. C. Kakas ; P. Mancarella |
| title_full_unstemmed | Stable theories for logic programs A. C. Kakas ; P. Mancarella |
| title_short | Stable theories for logic programs |
| title_sort | stable theories for logic programs |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV010841375 |
| work_keys_str_mv | AT kakasantonisc stabletheoriesforlogicprograms AT mancarellapaolo stabletheoriesforlogicprograms |