Theories of Intentions in the Framework of Situation Calculus
Identifieur interne : 00A177 ( Main/Curation ); précédent : 00A176; suivant : 00A178Theories of Intentions in the Framework of Situation Calculus
Auteurs : Pilar Pozos Parra [Australie] ; Abhaya Nayak [Australie] ; Robert Demolombe [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2005.
Descripteurs français
- Pascal (Inist)
- Wicri :
English descriptors
- KwdEn :
- Action function symbol, Action precondition axioms, Action precondition belief axioms, Action sequence, Action theories, Answer queries, Artificial intelligence, Axiom, Background axioms, Basic intention theory, Belief, Belief context, Belief desire intention model, Belief revision, Calculus, Certain conditions, Cognitive, Computational complexity, Corresponding situation, Declarative language, Demolombe, Discrete time, Dssgb dssg dssi, Equivalent queries, Expressive power, Frame problem, Free variables, Future situation, Ground situation, Hypothetical futures, Initial situation, Initial state, Intention, Intention theories, Knowledge representation, Last argument, Logical omniscience problem, Mental actions, Mental states, Modal logic, Modal logics, Multiagent system, Nayak, Original approach, Other hand, Parra, Possible execution, Pozos, Precise conditions, Precondition, Predicate, Predicate symbols, Previous situation, Programming language, Proof theory, Query, Rational agents, Real world, Regressable, Regressable formula, Regressable sentence, Regression operator, Relational, Robot, Situation calculus, Situation terms, Sort situation, Successor belief state axioms, Successor generalised belief state axioms, Successor goal state axioms, Successor intention state axioms, Successor state axiom, Successor state axioms, Theorem proving, True beliefs, Truth value, Type situation, Uent, Uent change, Uents, Uniform formula, Wrong beliefs.
- Teeft :
- Action function symbol, Action precondition axioms, Action precondition belief axioms, Action sequence, Action theories, Answer queries, Axiom, Background axioms, Basic intention theory, Belief context, Belief revision, Calculus, Certain conditions, Cognitive, Corresponding situation, Demolombe, Dssgb dssg dssi, Equivalent queries, Expressive power, Frame problem, Free variables, Future situation, Ground situation, Hypothetical futures, Initial situation, Initial state, Intention theories, Knowledge representation, Last argument, Logical omniscience problem, Mental actions, Mental states, Modal logics, Nayak, Original approach, Other hand, Parra, Possible execution, Pozos, Precise conditions, Precondition, Predicate, Predicate symbols, Previous situation, Query, Rational agents, Real world, Regressable, Regressable formula, Regressable sentence, Regression operator, Relational, Robot, Situation calculus, Situation terms, Sort situation, Successor belief state axioms, Successor generalised belief state axioms, Successor goal state axioms, Successor intention state axioms, Successor state axiom, Successor state axioms, True beliefs, Truth value, Type situation, Uent, Uent change, Uents, Uniform formula, Wrong beliefs.
Abstract
Abstract: We propose an extension of action theories to intention theories in the framework of situation calculus. Moreover the method for implementing action theories is adapted to consider the new components. The intention theories take account of the BDI (Belief-Desire-Intention) architecture. In order to avoid the computational complexity of theorem proving in modal logic, we explore an alternative approach that introduces the notions of belief, goal and intention fluents together with their associated successor state axioms. Hence, under certain conditions, reasoning about the BDI change is computationally similar to reasoning about ordinary fluent change. This approach can be implemented using declarative programming.
Url:
DOI: 10.1007/11493402_2
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000275
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :000275
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :001720
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :00AD41
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :004824
- to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :001879
- to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :004307
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :00AF57
Links to Exploration step
ISTEX:0E537DC09A65AAF47E7AEB9D631B965D489D3B89Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Theories of Intentions in the Framework of Situation Calculus</title><author><name sortKey="Parra, Pilar Pozos" sort="Parra, Pilar Pozos" uniqKey="Parra P" first="Pilar Pozos" last="Parra">Pilar Pozos Parra</name></author><author><name sortKey="Nayak, Abhaya" sort="Nayak, Abhaya" uniqKey="Nayak A" first="Abhaya" last="Nayak">Abhaya Nayak</name></author><author><name sortKey="Demolombe, Robert" sort="Demolombe, Robert" uniqKey="Demolombe R" first="Robert" last="Demolombe">Robert Demolombe</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:0E537DC09A65AAF47E7AEB9D631B965D489D3B89</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/11493402_2</idno><idno type="url">https://api.istex.fr/document/0E537DC09A65AAF47E7AEB9D631B965D489D3B89/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000275</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000275</idno><idno type="wicri:Area/Istex/Curation">000275</idno><idno type="wicri:Area/Istex/Checkpoint">001720</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001720</idno><idno type="wicri:doubleKey">0302-9743:2005:Parra P:theories:of:intentions</idno><idno type="wicri:Area/Main/Merge">00AD41</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:05-0358744</idno><idno type="wicri:Area/PascalFrancis/Corpus">004824</idno><idno type="wicri:Area/PascalFrancis/Curation">001879</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">004307</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">004307</idno><idno type="wicri:doubleKey">0302-9743:2005:Parra P:theories:of:intentions</idno><idno type="wicri:Area/Main/Merge">00AF57</idno><idno type="wicri:Area/Main/Curation">00A177</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Theories of Intentions in the Framework of Situation Calculus</title><author><name sortKey="Parra, Pilar Pozos" sort="Parra, Pilar Pozos" uniqKey="Parra P" first="Pilar Pozos" last="Parra">Pilar Pozos Parra</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>Division of ICS, Macquarie University, 2109, NSW</wicri:regionArea><wicri:noRegion>NSW</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Australie</country></affiliation></author><author><name sortKey="Nayak, Abhaya" sort="Nayak, Abhaya" uniqKey="Nayak A" first="Abhaya" last="Nayak">Abhaya Nayak</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>Division of ICS, Macquarie University, 2109, NSW</wicri:regionArea><wicri:noRegion>NSW</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Australie</country></affiliation></author><author><name sortKey="Demolombe, Robert" sort="Demolombe, Robert" uniqKey="Demolombe R" first="Robert" last="Demolombe">Robert Demolombe</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>ONERA-Toulouse, 2 Avenue E. Belin, BP 4025, 31055, Toulouse</wicri:regionArea><placeName><settlement type="city">Toulouse</settlement><region type="region" nuts="2">Occitanie (région administrative)</region><region type="old region" nuts="2">Midi-Pyrénées</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2005</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Action function symbol</term><term>Action precondition axioms</term><term>Action precondition belief axioms</term><term>Action sequence</term><term>Action theories</term><term>Answer queries</term><term>Artificial intelligence</term><term>Axiom</term><term>Background axioms</term><term>Basic intention theory</term><term>Belief</term><term>Belief context</term><term>Belief desire intention model</term><term>Belief revision</term><term>Calculus</term><term>Certain conditions</term><term>Cognitive</term><term>Computational complexity</term><term>Corresponding situation</term><term>Declarative language</term><term>Demolombe</term><term>Discrete time</term><term>Dssgb dssg dssi</term><term>Equivalent queries</term><term>Expressive power</term><term>Frame problem</term><term>Free variables</term><term>Future situation</term><term>Ground situation</term><term>Hypothetical futures</term><term>Initial situation</term><term>Initial state</term><term>Intention</term><term>Intention theories</term><term>Knowledge representation</term><term>Last argument</term><term>Logical omniscience problem</term><term>Mental actions</term><term>Mental states</term><term>Modal logic</term><term>Modal logics</term><term>Multiagent system</term><term>Nayak</term><term>Original approach</term><term>Other hand</term><term>Parra</term><term>Possible execution</term><term>Pozos</term><term>Precise conditions</term><term>Precondition</term><term>Predicate</term><term>Predicate symbols</term><term>Previous situation</term><term>Programming language</term><term>Proof theory</term><term>Query</term><term>Rational agents</term><term>Real world</term><term>Regressable</term><term>Regressable formula</term><term>Regressable sentence</term><term>Regression operator</term><term>Relational</term><term>Robot</term><term>Situation calculus</term><term>Situation terms</term><term>Sort situation</term><term>Successor belief state axioms</term><term>Successor generalised belief state axioms</term><term>Successor goal state axioms</term><term>Successor intention state axioms</term><term>Successor state axiom</term><term>Successor state axioms</term><term>Theorem proving</term><term>True beliefs</term><term>Truth value</term><term>Type situation</term><term>Uent</term><term>Uent change</term><term>Uents</term><term>Uniform formula</term><term>Wrong beliefs</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>.</term><term>Complexité calcul</term><term>Croyance</term><term>Démonstration théorème</term><term>Intelligence artificielle</term><term>Intention</term><term>Langage déclaratif</term><term>Langage programmation</term><term>Logique modale</term><term>Modèle BDI</term><term>Système multiagent</term><term>Temps discret</term><term>Théorie preuve</term></keywords><keywords scheme="Teeft" xml:lang="en"><term>Action function symbol</term><term>Action precondition axioms</term><term>Action precondition belief axioms</term><term>Action sequence</term><term>Action theories</term><term>Answer queries</term><term>Axiom</term><term>Background axioms</term><term>Basic intention theory</term><term>Belief context</term><term>Belief revision</term><term>Calculus</term><term>Certain conditions</term><term>Cognitive</term><term>Corresponding situation</term><term>Demolombe</term><term>Dssgb dssg dssi</term><term>Equivalent queries</term><term>Expressive power</term><term>Frame problem</term><term>Free variables</term><term>Future situation</term><term>Ground situation</term><term>Hypothetical futures</term><term>Initial situation</term><term>Initial state</term><term>Intention theories</term><term>Knowledge representation</term><term>Last argument</term><term>Logical omniscience problem</term><term>Mental actions</term><term>Mental states</term><term>Modal logics</term><term>Nayak</term><term>Original approach</term><term>Other hand</term><term>Parra</term><term>Possible execution</term><term>Pozos</term><term>Precise conditions</term><term>Precondition</term><term>Predicate</term><term>Predicate symbols</term><term>Previous situation</term><term>Query</term><term>Rational agents</term><term>Real world</term><term>Regressable</term><term>Regressable formula</term><term>Regressable sentence</term><term>Regression operator</term><term>Relational</term><term>Robot</term><term>Situation calculus</term><term>Situation terms</term><term>Sort situation</term><term>Successor belief state axioms</term><term>Successor generalised belief state axioms</term><term>Successor goal state axioms</term><term>Successor intention state axioms</term><term>Successor state axiom</term><term>Successor state axioms</term><term>True beliefs</term><term>Truth value</term><term>Type situation</term><term>Uent</term><term>Uent change</term><term>Uents</term><term>Uniform formula</term><term>Wrong beliefs</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Intelligence artificielle</term><term>Langage de programmation</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We propose an extension of action theories to intention theories in the framework of situation calculus. Moreover the method for implementing action theories is adapted to consider the new components. The intention theories take account of the BDI (Belief-Desire-Intention) architecture. In order to avoid the computational complexity of theorem proving in modal logic, we explore an alternative approach that introduces the notions of belief, goal and intention fluents together with their associated successor state axioms. Hence, under certain conditions, reasoning about the BDI change is computationally similar to reasoning about ordinary fluent change. This approach can be implemented using declarative programming.</div></front></TEI><double idat="0302-9743:2005:Parra P:theories:of:intentions"><INIST><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Theories of intentions in the framework of situation calculus</title><author><name sortKey="Parra, Pilar Pozos" sort="Parra, Pilar Pozos" uniqKey="Parra P" first="Pilar Pozos" last="Parra">Pilar Pozos Parra</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Division of ICS, Macquarie University</s1><s2>NSW 2109</s2><s3>AUS</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>NSW 2109</wicri:noRegion></affiliation></author><author><name sortKey="Nayak, Abhaya" sort="Nayak, Abhaya" uniqKey="Nayak A" first="Abhaya" last="Nayak">Abhaya Nayak</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Division of ICS, Macquarie University</s1><s2>NSW 2109</s2><s3>AUS</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>NSW 2109</wicri:noRegion></affiliation></author><author><name sortKey="Demolombe, Robert" sort="Demolombe, Robert" uniqKey="Demolombe R" first="Robert" last="Demolombe">Robert Demolombe</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>ONERA-Toulouse, 2 Avenue E. Belin BP 4025</s1><s2>31055 Toulouse</s2><s3>FRA</s3><sZ>3 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>31055 Toulouse</wicri:noRegion><placeName><settlement type="city">Toulouse</settlement><region type="region" nuts="2">Occitanie (région administrative)</region><region type="old region" nuts="2">Midi-Pyrénées</region></placeName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">05-0358744</idno><date when="2005">2005</date><idno type="stanalyst">PASCAL 05-0358744 INIST</idno><idno type="RBID">Pascal:05-0358744</idno><idno type="wicri:Area/PascalFrancis/Corpus">004824</idno><idno type="wicri:Area/PascalFrancis/Curation">001879</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">004307</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">004307</idno><idno type="wicri:doubleKey">0302-9743:2005:Parra P:theories:of:intentions</idno><idno type="wicri:Area/Main/Merge">00AF57</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Theories of intentions in the framework of situation calculus</title><author><name sortKey="Parra, Pilar Pozos" sort="Parra, Pilar Pozos" uniqKey="Parra P" first="Pilar Pozos" last="Parra">Pilar Pozos Parra</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Division of ICS, Macquarie University</s1><s2>NSW 2109</s2><s3>AUS</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>NSW 2109</wicri:noRegion></affiliation></author><author><name sortKey="Nayak, Abhaya" sort="Nayak, Abhaya" uniqKey="Nayak A" first="Abhaya" last="Nayak">Abhaya Nayak</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Division of ICS, Macquarie University</s1><s2>NSW 2109</s2><s3>AUS</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>NSW 2109</wicri:noRegion></affiliation></author><author><name sortKey="Demolombe, Robert" sort="Demolombe, Robert" uniqKey="Demolombe R" first="Robert" last="Demolombe">Robert Demolombe</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>ONERA-Toulouse, 2 Avenue E. Belin BP 4025</s1><s2>31055 Toulouse</s2><s3>FRA</s3><sZ>3 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>31055 Toulouse</wicri:noRegion><placeName><settlement type="city">Toulouse</settlement><region type="region" nuts="2">Occitanie (région administrative)</region><region type="old region" nuts="2">Midi-Pyrénées</region></placeName></affiliation></author></analytic><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="2005">2005</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Artificial intelligence</term><term>Belief</term><term>Belief desire intention model</term><term>Computational complexity</term><term>Declarative language</term><term>Discrete time</term><term>Intention</term><term>Modal logic</term><term>Multiagent system</term><term>Programming language</term><term>Proof theory</term><term>Theorem proving</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Système multiagent</term><term>Langage programmation</term><term>Intelligence artificielle</term><term>Complexité calcul</term><term>Démonstration théorème</term><term>Théorie preuve</term><term>Logique modale</term><term>Croyance</term><term>Intention</term><term>Langage déclaratif</term><term>Temps discret</term><term>.</term><term>Modèle BDI</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Langage de programmation</term><term>Intelligence artificielle</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We propose an extension of action theories to intention theories in the framework of situation calculus. Moreover the method for implementing action theories is adapted to consider the new components. The intention theories take account of the BDI (Belief-Desire-Intention) architecture. In order to avoid the computational complexity of theorem proving in modal logic, we explore an alternative approach that introduces the notions of belief, goal and intention fluents together with their associated successor state axioms. Hence, under certain conditions, reasoning about the BDI change is computationally similar to reasoning about ordinary fluent change. This approach can be implemented using declarative programming.</div></front></TEI></INIST><ISTEX><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Theories of Intentions in the Framework of Situation Calculus</title><author><name sortKey="Parra, Pilar Pozos" sort="Parra, Pilar Pozos" uniqKey="Parra P" first="Pilar Pozos" last="Parra">Pilar Pozos Parra</name></author><author><name sortKey="Nayak, Abhaya" sort="Nayak, Abhaya" uniqKey="Nayak A" first="Abhaya" last="Nayak">Abhaya Nayak</name></author><author><name sortKey="Demolombe, Robert" sort="Demolombe, Robert" uniqKey="Demolombe R" first="Robert" last="Demolombe">Robert Demolombe</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:0E537DC09A65AAF47E7AEB9D631B965D489D3B89</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/11493402_2</idno><idno type="url">https://api.istex.fr/document/0E537DC09A65AAF47E7AEB9D631B965D489D3B89/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000275</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000275</idno><idno type="wicri:Area/Istex/Curation">000275</idno><idno type="wicri:Area/Istex/Checkpoint">001720</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001720</idno><idno type="wicri:doubleKey">0302-9743:2005:Parra P:theories:of:intentions</idno><idno type="wicri:Area/Main/Merge">00AD41</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Theories of Intentions in the Framework of Situation Calculus</title><author><name sortKey="Parra, Pilar Pozos" sort="Parra, Pilar Pozos" uniqKey="Parra P" first="Pilar Pozos" last="Parra">Pilar Pozos Parra</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>Division of ICS, Macquarie University, 2109, NSW</wicri:regionArea><wicri:noRegion>NSW</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Australie</country></affiliation></author><author><name sortKey="Nayak, Abhaya" sort="Nayak, Abhaya" uniqKey="Nayak A" first="Abhaya" last="Nayak">Abhaya Nayak</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>Division of ICS, Macquarie University, 2109, NSW</wicri:regionArea><wicri:noRegion>NSW</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Australie</country></affiliation></author><author><name sortKey="Demolombe, Robert" sort="Demolombe, Robert" uniqKey="Demolombe R" first="Robert" last="Demolombe">Robert Demolombe</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>ONERA-Toulouse, 2 Avenue E. Belin, BP 4025, 31055, Toulouse</wicri:regionArea><placeName><settlement type="city">Toulouse</settlement><region type="region" nuts="2">Occitanie (région administrative)</region><region type="old region" nuts="2">Midi-Pyrénées</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2005</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Action function symbol</term><term>Action precondition axioms</term><term>Action precondition belief axioms</term><term>Action sequence</term><term>Action theories</term><term>Answer queries</term><term>Axiom</term><term>Background axioms</term><term>Basic intention theory</term><term>Belief context</term><term>Belief revision</term><term>Calculus</term><term>Certain conditions</term><term>Cognitive</term><term>Corresponding situation</term><term>Demolombe</term><term>Dssgb dssg dssi</term><term>Equivalent queries</term><term>Expressive power</term><term>Frame problem</term><term>Free variables</term><term>Future situation</term><term>Ground situation</term><term>Hypothetical futures</term><term>Initial situation</term><term>Initial state</term><term>Intention theories</term><term>Knowledge representation</term><term>Last argument</term><term>Logical omniscience problem</term><term>Mental actions</term><term>Mental states</term><term>Modal logics</term><term>Nayak</term><term>Original approach</term><term>Other hand</term><term>Parra</term><term>Possible execution</term><term>Pozos</term><term>Precise conditions</term><term>Precondition</term><term>Predicate</term><term>Predicate symbols</term><term>Previous situation</term><term>Query</term><term>Rational agents</term><term>Real world</term><term>Regressable</term><term>Regressable formula</term><term>Regressable sentence</term><term>Regression operator</term><term>Relational</term><term>Robot</term><term>Situation calculus</term><term>Situation terms</term><term>Sort situation</term><term>Successor belief state axioms</term><term>Successor generalised belief state axioms</term><term>Successor goal state axioms</term><term>Successor intention state axioms</term><term>Successor state axiom</term><term>Successor state axioms</term><term>True beliefs</term><term>Truth value</term><term>Type situation</term><term>Uent</term><term>Uent change</term><term>Uents</term><term>Uniform formula</term><term>Wrong beliefs</term></keywords><keywords scheme="Teeft" xml:lang="en"><term>Action function symbol</term><term>Action precondition axioms</term><term>Action precondition belief axioms</term><term>Action sequence</term><term>Action theories</term><term>Answer queries</term><term>Axiom</term><term>Background axioms</term><term>Basic intention theory</term><term>Belief context</term><term>Belief revision</term><term>Calculus</term><term>Certain conditions</term><term>Cognitive</term><term>Corresponding situation</term><term>Demolombe</term><term>Dssgb dssg dssi</term><term>Equivalent queries</term><term>Expressive power</term><term>Frame problem</term><term>Free variables</term><term>Future situation</term><term>Ground situation</term><term>Hypothetical futures</term><term>Initial situation</term><term>Initial state</term><term>Intention theories</term><term>Knowledge representation</term><term>Last argument</term><term>Logical omniscience problem</term><term>Mental actions</term><term>Mental states</term><term>Modal logics</term><term>Nayak</term><term>Original approach</term><term>Other hand</term><term>Parra</term><term>Possible execution</term><term>Pozos</term><term>Precise conditions</term><term>Precondition</term><term>Predicate</term><term>Predicate symbols</term><term>Previous situation</term><term>Query</term><term>Rational agents</term><term>Real world</term><term>Regressable</term><term>Regressable formula</term><term>Regressable sentence</term><term>Regression operator</term><term>Relational</term><term>Robot</term><term>Situation calculus</term><term>Situation terms</term><term>Sort situation</term><term>Successor belief state axioms</term><term>Successor generalised belief state axioms</term><term>Successor goal state axioms</term><term>Successor intention state axioms</term><term>Successor state axiom</term><term>Successor state axioms</term><term>True beliefs</term><term>Truth value</term><term>Type situation</term><term>Uent</term><term>Uent change</term><term>Uents</term><term>Uniform formula</term><term>Wrong beliefs</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We propose an extension of action theories to intention theories in the framework of situation calculus. Moreover the method for implementing action theories is adapted to consider the new components. The intention theories take account of the BDI (Belief-Desire-Intention) architecture. In order to avoid the computational complexity of theorem proving in modal logic, we explore an alternative approach that introduces the notions of belief, goal and intention fluents together with their associated successor state axioms. Hence, under certain conditions, reasoning about the BDI change is computationally similar to reasoning about ordinary fluent change. This approach can be implemented using declarative programming.</div></front></TEI></ISTEX></double></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00A177 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 00A177 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Asie
|area= AustralieFrV1
|flux= Main
|étape= Curation
|type= RBID
|clé= ISTEX:0E537DC09A65AAF47E7AEB9D631B965D489D3B89
|texte= Theories of Intentions in the Framework of Situation Calculus
}}
| This area was generated with Dilib version V0.6.33. |  |