Monotonic solution of the frame problem in the situation calculus: an efficient method for worlds with fully specified actions
Abstract: "The paper is concerned with the succinct axiomatization and efficient deduction of non-change, within McCarthy and Hayes' Situation Calculus. The idea behind the proposed approach is this: suppose that in a room containing a man, a robot and a cat as the only potential agents, t...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Rochester, NY
1989
|
| Schriftenreihe: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
306 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The paper is concerned with the succinct axiomatization and efficient deduction of non-change, within McCarthy and Hayes' Situation Calculus. The idea behind the proposed approach is this: suppose that in a room containing a man, a robot and a cat as the only potential agents, the only action taken by the man within a certain time interval is to walk from one place to another, while the robot's only actions are to pick up a box containing the (inactive) cat and carry it from its initial place to another. We wish to prove that a certain object (such as the cat, or the doormat) did not change color. We reason that the only way it could have changed color is for the man or the robot to have painted or dyed it But since these are not among the actions which actually occurred, the color of the object is unchanged. Thus we need no frame axioms to the effect that walking and carrying leave colors unchanged (which is in general false in multi-agent worlds), and no fault schema that properties change only when we can prove they do (which is in general false in incompletely known worlds). Instead we use explanation-closure axioms specifying all primitive actions which can produce a given type of change within the setting of interest. A method similar to this has been proposed by Andrew Haas for single-agent, serial worlds The contribution of the present paper lies in showing (1) that such methods do indeed encode non-change succinctly, (2) are independently motivated, (3) can be used to justify highly efficient methods of inferring non-change, specifically the "sleeping dog" strategy of STRIPS, and (4) can be extended to simple multiagent worlds with concurrent actions. An ultimate limitation may lie in the lack of a uniform strategy for deciding what fluents can be affected by what agents in a given domain. In this respect probabilistic methods appear promising. |
| Beschreibung: | 48 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008948955 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)23662254 | ||
| 035 | |a (DE-599)BVBBV008948955 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Schuber, Lenhart K. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Monotonic solution of the frame problem in the situation calculus |b an efficient method for worlds with fully specified actions |
| 264 | 1 | |a Rochester, NY |c 1989 | |
| 300 | |a 48 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |v 306 | |
| 520 | 3 | |a Abstract: "The paper is concerned with the succinct axiomatization and efficient deduction of non-change, within McCarthy and Hayes' Situation Calculus. The idea behind the proposed approach is this: suppose that in a room containing a man, a robot and a cat as the only potential agents, the only action taken by the man within a certain time interval is to walk from one place to another, while the robot's only actions are to pick up a box containing the (inactive) cat and carry it from its initial place to another. We wish to prove that a certain object (such as the cat, or the doormat) did not change color. We reason that the only way it could have changed color is for the man or the robot to have painted or dyed it | |
| 520 | 3 | |a But since these are not among the actions which actually occurred, the color of the object is unchanged. Thus we need no frame axioms to the effect that walking and carrying leave colors unchanged (which is in general false in multi-agent worlds), and no fault schema that properties change only when we can prove they do (which is in general false in incompletely known worlds). Instead we use explanation-closure axioms specifying all primitive actions which can produce a given type of change within the setting of interest. A method similar to this has been proposed by Andrew Haas for single-agent, serial worlds | |
| 520 | 3 | |a The contribution of the present paper lies in showing (1) that such methods do indeed encode non-change succinctly, (2) are independently motivated, (3) can be used to justify highly efficient methods of inferring non-change, specifically the "sleeping dog" strategy of STRIPS, and (4) can be extended to simple multiagent worlds with concurrent actions. An ultimate limitation may lie in the lack of a uniform strategy for deciding what fluents can be affected by what agents in a given domain. In this respect probabilistic methods appear promising. | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Problem solving | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 306 |w (DE-604)BV008902697 |9 306 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005904675 | ||
Datensatz im Suchindex
| _version_ | 1804123281951817728 |
|---|---|
| any_adam_object | |
| author | Schuber, Lenhart K. |
| author_facet | Schuber, Lenhart K. |
| author_role | aut |
| author_sort | Schuber, Lenhart K. |
| author_variant | l k s lk lks |
| building | Verbundindex |
| bvnumber | BV008948955 |
| ctrlnum | (OCoLC)23662254 (DE-599)BVBBV008948955 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03018nam a2200337 cb4500</leader><controlfield tag="001">BV008948955</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23662254</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008948955</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">Schuber, Lenhart K.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Monotonic solution of the frame problem in the situation calculus</subfield><subfield code="b">an efficient method for worlds with fully specified actions</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rochester, NY</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">48 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">University of Rochester <Rochester, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">306</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The paper is concerned with the succinct axiomatization and efficient deduction of non-change, within McCarthy and Hayes' Situation Calculus. The idea behind the proposed approach is this: suppose that in a room containing a man, a robot and a cat as the only potential agents, the only action taken by the man within a certain time interval is to walk from one place to another, while the robot's only actions are to pick up a box containing the (inactive) cat and carry it from its initial place to another. We wish to prove that a certain object (such as the cat, or the doormat) did not change color. We reason that the only way it could have changed color is for the man or the robot to have painted or dyed it</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">But since these are not among the actions which actually occurred, the color of the object is unchanged. Thus we need no frame axioms to the effect that walking and carrying leave colors unchanged (which is in general false in multi-agent worlds), and no fault schema that properties change only when we can prove they do (which is in general false in incompletely known worlds). Instead we use explanation-closure axioms specifying all primitive actions which can produce a given type of change within the setting of interest. A method similar to this has been proposed by Andrew Haas for single-agent, serial worlds</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The contribution of the present paper lies in showing (1) that such methods do indeed encode non-change succinctly, (2) are independently motivated, (3) can be used to justify highly efficient methods of inferring non-change, specifically the "sleeping dog" strategy of STRIPS, and (4) can be extended to simple multiagent worlds with concurrent actions. An ultimate limitation may lie in the lack of a uniform strategy for deciding what fluents can be affected by what agents in a given domain. In this respect probabilistic methods appear promising.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Problem solving</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Rochester <Rochester, NY></subfield><subfield code="v">306</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">306</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005904675</subfield></datafield></record></collection> |
| id | DE-604.BV008948955 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:17Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005904675 |
| oclc_num | 23662254 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 48 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
| spelling | Schuber, Lenhart K. Verfasser aut Monotonic solution of the frame problem in the situation calculus an efficient method for worlds with fully specified actions Rochester, NY 1989 48 S. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 306 Abstract: "The paper is concerned with the succinct axiomatization and efficient deduction of non-change, within McCarthy and Hayes' Situation Calculus. The idea behind the proposed approach is this: suppose that in a room containing a man, a robot and a cat as the only potential agents, the only action taken by the man within a certain time interval is to walk from one place to another, while the robot's only actions are to pick up a box containing the (inactive) cat and carry it from its initial place to another. We wish to prove that a certain object (such as the cat, or the doormat) did not change color. We reason that the only way it could have changed color is for the man or the robot to have painted or dyed it But since these are not among the actions which actually occurred, the color of the object is unchanged. Thus we need no frame axioms to the effect that walking and carrying leave colors unchanged (which is in general false in multi-agent worlds), and no fault schema that properties change only when we can prove they do (which is in general false in incompletely known worlds). Instead we use explanation-closure axioms specifying all primitive actions which can produce a given type of change within the setting of interest. A method similar to this has been proposed by Andrew Haas for single-agent, serial worlds The contribution of the present paper lies in showing (1) that such methods do indeed encode non-change succinctly, (2) are independently motivated, (3) can be used to justify highly efficient methods of inferring non-change, specifically the "sleeping dog" strategy of STRIPS, and (4) can be extended to simple multiagent worlds with concurrent actions. An ultimate limitation may lie in the lack of a uniform strategy for deciding what fluents can be affected by what agents in a given domain. In this respect probabilistic methods appear promising. Künstliche Intelligenz Artificial intelligence Problem solving Department of Computer Science: Technical report University of Rochester <Rochester, NY> 306 (DE-604)BV008902697 306 |
| spellingShingle | Schuber, Lenhart K. Monotonic solution of the frame problem in the situation calculus an efficient method for worlds with fully specified actions Künstliche Intelligenz Artificial intelligence Problem solving |
| title | Monotonic solution of the frame problem in the situation calculus an efficient method for worlds with fully specified actions |
| title_auth | Monotonic solution of the frame problem in the situation calculus an efficient method for worlds with fully specified actions |
| title_exact_search | Monotonic solution of the frame problem in the situation calculus an efficient method for worlds with fully specified actions |
| title_full | Monotonic solution of the frame problem in the situation calculus an efficient method for worlds with fully specified actions |
| title_fullStr | Monotonic solution of the frame problem in the situation calculus an efficient method for worlds with fully specified actions |
| title_full_unstemmed | Monotonic solution of the frame problem in the situation calculus an efficient method for worlds with fully specified actions |
| title_short | Monotonic solution of the frame problem in the situation calculus |
| title_sort | monotonic solution of the frame problem in the situation calculus an efficient method for worlds with fully specified actions |
| title_sub | an efficient method for worlds with fully specified actions |
| topic | Künstliche Intelligenz Artificial intelligence Problem solving |
| topic_facet | Künstliche Intelligenz Artificial intelligence Problem solving |
| volume_link | (DE-604)BV008902697 |
| work_keys_str_mv | AT schuberlenhartk monotonicsolutionoftheframeprobleminthesituationcalculusanefficientmethodforworldswithfullyspecifiedactions |