Some uses of constructive negation for classical problems in non-monotonic reasoning:
Abstract: "We use general logic programs to formalize some classical problems in non-monotonic reasoning. More specifically, this paper shows how some forms of temporal reasoning and of planning problems can be easily formalized by using two restricted classes of programs, called acyclic and ac...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1994
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
94,66 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We use general logic programs to formalize some classical problems in non-monotonic reasoning. More specifically, this paper shows how some forms of temporal reasoning and of planning problems can be easily formalized by using two restricted classes of programs, called acyclic and acceptable programs. Moreover, we show how for these programs more queries can be answered when a form of constructive negation is incorporated into the proof theory." |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010162078 | ||
| 003 | DE-604 | ||
| 005 | 19950428 | ||
| 007 | t | ||
| 008 | 950428s1994 |||| 00||| engod | ||
| 035 | |a (OCoLC)33099204 | ||
| 035 | |a (DE-599)BVBBV010162078 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Marchiori, Elena |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Some uses of constructive negation for classical problems in non-monotonic reasoning |c E. Marchiori |
| 264 | 1 | |a Amsterdam |c 1994 | |
| 300 | |a 16 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 94,66 | |
| 520 | 3 | |a Abstract: "We use general logic programs to formalize some classical problems in non-monotonic reasoning. More specifically, this paper shows how some forms of temporal reasoning and of planning problems can be easily formalized by using two restricted classes of programs, called acyclic and acceptable programs. Moreover, we show how for these programs more queries can be answered when a form of constructive negation is incorporated into the proof theory." | |
| 650 | 4 | |a Logic programming | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 94,66 |w (DE-604)BV008928356 |9 94,66 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006748546 | ||
Datensatz im Suchindex
| _version_ | 1804124556798984192 |
|---|---|
| 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 | BV010162078 |
| ctrlnum | (OCoLC)33099204 (DE-599)BVBBV010162078 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01424nam a2200277 cb4500</leader><controlfield tag="001">BV010162078</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950428 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950428s1994 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33099204</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010162078</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="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">Some uses of constructive negation for classical problems in non-monotonic reasoning</subfield><subfield code="c">E. Marchiori</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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">94,66</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We use general logic programs to formalize some classical problems in non-monotonic reasoning. More specifically, this paper shows how some forms of temporal reasoning and of planning problems can be easily formalized by using two restricted classes of programs, called acyclic and acceptable programs. Moreover, we show how for these programs more queries can be answered when a form of constructive negation is incorporated into the proof theory."</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">94,66</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">94,66</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006748546</subfield></datafield></record></collection> |
| id | DE-604.BV010162078 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:33Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006748546 |
| oclc_num | 33099204 |
| open_access_boolean | |
| physical | 16 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Marchiori, Elena Verfasser aut Some uses of constructive negation for classical problems in non-monotonic reasoning E. Marchiori Amsterdam 1994 16 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 94,66 Abstract: "We use general logic programs to formalize some classical problems in non-monotonic reasoning. More specifically, this paper shows how some forms of temporal reasoning and of planning problems can be easily formalized by using two restricted classes of programs, called acyclic and acceptable programs. Moreover, we show how for these programs more queries can be answered when a form of constructive negation is incorporated into the proof theory." Logic programming Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 94,66 (DE-604)BV008928356 94,66 |
| spellingShingle | Marchiori, Elena Some uses of constructive negation for classical problems in non-monotonic reasoning Logic programming |
| title | Some uses of constructive negation for classical problems in non-monotonic reasoning |
| title_auth | Some uses of constructive negation for classical problems in non-monotonic reasoning |
| title_exact_search | Some uses of constructive negation for classical problems in non-monotonic reasoning |
| title_full | Some uses of constructive negation for classical problems in non-monotonic reasoning E. Marchiori |
| title_fullStr | Some uses of constructive negation for classical problems in non-monotonic reasoning E. Marchiori |
| title_full_unstemmed | Some uses of constructive negation for classical problems in non-monotonic reasoning E. Marchiori |
| title_short | Some uses of constructive negation for classical problems in non-monotonic reasoning |
| title_sort | some uses of constructive negation for classical problems in non monotonic reasoning |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT marchiorielena someusesofconstructivenegationforclassicalproblemsinnonmonotonicreasoning |