Filters








874,351 Hits in 8.2 sec

Reasoning about Strategies: on the Satisfiability Problem [article]

Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi
<span title="2017-03-13">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We prove that, unlike SL, SL[1G] has the bounded tree-model property and its satisfiability problem is decidable in 2ExpTime, thus not harder than the one for ATL*.  ...  Strategy Logic (SL, for short) has been introduced by Mogavero, Murano, and Vardi as a useful formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent concurrent games  ...  REASONING ABOUT STRATEGIES: ON THE SATISFIABILITY PROBLEM 29 rl with Dm being a non-empty domain and where rl(r) ⊆ ar(r) → Dm is a set of functions, representing the tuples on which the relation r ∈ Rl  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1611.08541v2">arXiv:1611.08541v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/eaqnccx2frhvfc3sja55wxg5te">fatcat:eaqnccx2frhvfc3sja55wxg5te</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200904022610/https://arxiv.org/pdf/1611.08541v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b7/12/b712cf09c73046955fc7a05bdd5131fdbb28dca8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1611.08541v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Reasoning About Strategies [chapter]

Fabio Mogavero
<span title="">2013</span> <i title="Atlantis Press"> Logics in Computer Science </i> &nbsp;
Recently, Chatterjee, Henzinger, and Piterman introduced Strategy Logic, which we denote here by SL CHP , with the aim of getting a powerful framework for reasoning explicitly about strategies.  ...  In this paper, we introduce and study a more general strategy logic, denoted SL, for reasoning about strategies in multi-agent concurrent systems.  ...  ATL* allows reasoning about strategies for agents with temporal goals.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2991/978-94-91216-95-4_3">doi:10.2991/978-94-91216-95-4_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y5triafsqvctxfjsdvytpy4yke">fatcat:y5triafsqvctxfjsdvytpy4yke</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180514033325/http://drops.dagstuhl.de/opus/volltexte/2010/2859/pdf/13.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2f/f7/2ff7d610344458ce66fafd8a7884954b968b19c6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2991/978-94-91216-95-4_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Reasoning about Knowledge and Strategies: Epistemic Strategy Logic

Francesco Belardinelli
<span title="2014-04-01">2014</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzezkwolyvf33pglm2jldjklca" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
This enhanced framework allows us to represent explicitly and to reason about the knowledge agents have of their own and other agents' strategies.  ...  We provide a semantics to ESL in terms of epistemic concurrent game models, and consider the corresponding model checking problem.  ...  to reason about their strategic abilities.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.146.4">doi:10.4204/eptcs.146.4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4nxhuiiitjg3ljz2q42mouv24u">fatcat:4nxhuiiitjg3ljz2q42mouv24u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705100535/https://www.ibisc.univ-evry.fr/%7Ebelardinelli/Documents/sr2014.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e0/08/e008ee1f8ac718f6262f8bee6e582e631c6705ec.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.146.4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Reasoning About Strategies: On the Model-Checking Problem [article]

Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi
<span title="2012-02-06">2012</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
About these logics, we prove that the model-checking problem for SL[1G] is 2ExpTime-complete, thus not harder than the one for ATL\star.  ...  In this paper, we introduce and study a more general strategy logic, denoted SL, for reasoning about strategies in multi-agent concurrent games.  ...  This idea allows us to enormously simplify the reasoning about strategy quantifications, since we can reduce them to a set of quantifications over actions, one for each track in their domains.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1112.6275v2">arXiv:1112.6275v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lrrdgj6rqjghrjmdxhjnf4qugy">fatcat:lrrdgj6rqjghrjmdxhjnf4qugy</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1112.6275/1112.6275.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/09/2a/092aa24dc1e7e68b49ccd488e5701859b0c25169.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1112.6275v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Representing and Reasoning about Game Strategies [article]

Dongmo Zhang, Michael Thielsher
<span title="2014-07-21">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
As such, problems that require reasoning about games can be solved by the standard methods for reasoning about actions and change.  ...  conjunction with game rules and strategy rules in the Situation Calculus; second, we show how the reasoning problem can be solved with Answer Set Programming.  ...  The second author was the recipient of an ARC Future Fellowship (project number FT 0991348). He is also affiliated with the University of Western Sydney.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1407.5380v1">arXiv:1407.5380v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hivxyc2mzbayde5uskxtcqkmx4">fatcat:hivxyc2mzbayde5uskxtcqkmx4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200901095523/https://arxiv.org/pdf/1407.5380v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/07/fd/07fdaa247f4c042e7965629705d805aca4453238.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1407.5380v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Representing and Reasoning about Game Strategies

Dongmo Zhang, Michael Thielscher
<span title="2014-10-21">2014</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ankkynzqs5dqbo4lk5zcpua7rq" style="color: black;">Journal of Philosophical Logic</a> </i> &nbsp;
As such, problems that require reasoning about games can be solved by the standard methods for reasoning about actions and change.  ...  with game rules and strategy rules in the Situation Calculus; second, we show how the reasoning problem can be solved with Answer Set Programming.  ...  The second author is the recipient of an ARC Future Fellowship (project number FT 0991348). He is also affiliated with the University of Western Sydney.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10992-014-9334-6">doi:10.1007/s10992-014-9334-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qwu7yqqkorbevhoh7a3ttxkucu">fatcat:qwu7yqqkorbevhoh7a3ttxkucu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811012230/http://cgi.cse.unsw.edu.au/~mit/Papers/JPL15.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d8/74/d8746529b65bf3c20eb714a96badd15fbdc0615e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10992-014-9334-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Strategy Logic with Simple Goals: Tractable Reasoning about Strategies

Francesco Belardinelli, Wojciech Jamroga, Damian Kurpiewski, Vadim Malvone, Aniello Murano
<span title="">2019</span> <i title="International Joint Conferences on Artificial Intelligence Organization"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vfwwmrihanevtjbbkti2kc3nke" style="color: black;">Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence</a> </i> &nbsp;
over the agents' strategies.  ...  Most importantly, we prove that the model checking problem for SL[SG] is PTIME-complete, the same as ATL.  ...  Logics for strategies are a powerful tool for strategic reasoning in MAS. Their major bottleneck is the high complexity of the related decision problems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.24963/ijcai.2019/13">doi:10.24963/ijcai.2019/13</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ijcai/BelardinelliJKM19.html">dblp:conf/ijcai/BelardinelliJKM19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gpd3vhelozdtzgupkbkvx3sbg4">fatcat:gpd3vhelozdtzgupkbkvx3sbg4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200510154639/https://hal.archives-ouvertes.fr/hal-02377403/file/IJCAI19.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1d/53/1d531ccdd46b01506ee341d5ac2164df38169b02.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.24963/ijcai.2019/13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Reasoning about Knowledge and Strategies under Hierarchical Information [article]

Bastien Maubert, Aniello Murano
<span title="2018-09-03">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Two distinct semantics have been considered for knowledge in the context of strategic reasoning, depending on whether players know each other's strategy or not.  ...  However, for the other, uninformed semantics, the problem is decidable on such systems.  ...  Acknowledgements This project has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 709188.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1806.00028v2">arXiv:1806.00028v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ubxs6xnrmzdsfkodff6aio2xqy">fatcat:ubxs6xnrmzdsfkodff6aio2xqy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191018111351/https://arxiv.org/pdf/1806.00028v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/40/5c/405ce3f217cb99d6a1a12850f177997484cea2e3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1806.00028v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Reasoning about Strategies under Partial Observability and Fairness Constraints

Simon Busard, Charles Pecheur, Hongyang Qu, Franco Raimondi
<span title="2013-03-01">2013</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzezkwolyvf33pglm2jldjklca" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
A number of extensions exist for Alternating-time Temporal Logic; some of these mix strategies and partial observability but, to the best of our knowledge, no work provides a unified framework for strategies  ...  In this paper we propose ATLK^F_po, a logic mixing strategies under partial observability and epistemic properties of agents in a system with fairness constraints on states, and we provide a model checking  ...  A model M represents a non-deterministic system where each agent has an imperfect information about the current global state.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.112.12">doi:10.4204/eptcs.112.12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6767ks4t4vashlavvt6t7kmqui">fatcat:6767ks4t4vashlavvt6t7kmqui</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922222135/http://eprints.mdx.ac.uk/15130/1/sr13-final.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c9/77/c977fec2133024451ebaf15cae1737e54ae13ad2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.112.12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Reasoning about relations

Geoffrey P. Goodwin, P. N. Johnson-Laird
<span title="">2005</span> <i title="American Psychological Association (APA)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7dgw55nuivbwlepq7ytxkik6ny" style="color: black;">Psychological review</a> </i> &nbsp;
Inferences about spatial, temporal, and other relations are ubiquitous. This article presents a novel model-based theory of such reasoning. The theory depends on 5 principles.  ...  (d) They spontaneously develop their own strategies for relational reasoning.  ...  Strategies in Relational Reasoning The pioneering studies of strategies in reasoning were based on series problems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1037/0033-295x.112.2.468">doi:10.1037/0033-295x.112.2.468</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/15783294">pmid:15783294</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zr27l4yg2fgffa72lxvuqpc3ui">fatcat:zr27l4yg2fgffa72lxvuqpc3ui</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060919195549/http://webscript.princeton.edu:80/%7Epsych/psychology/research/johnson_laird/pdfs/2005reasoningrelations.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/13/41/134152cb1d5803351756c65d8321c7dbc47a954d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1037/0033-295x.112.2.468"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

On the satisfiability problem for SPARQL patterns [article]

Xiaowang Zhang, Jan Van den Bussche, François Picalausa
<span title="2016-06-01">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1.0 is comparable with that of the relational algebra.  ...  When no inconsistent filter conditions can be formed, satisfiability is efficiently decidable by simple checks on bound variables and on the use of literals.  ...  Acknowledgment We thank the anonymous referees for their critical comments on a previous version of this paper, which encouraged us to significantly improve the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1406.1404v2">arXiv:1406.1404v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zy24mdadcbh7djpzijhql6qwbi">fatcat:zy24mdadcbh7djpzijhql6qwbi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200830124829/https://arxiv.org/pdf/1406.1404v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d6/19/d61948f541ac8df1aec5e9f059034b816618a7e7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1406.1404v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Reasoning about strategies on collapsible pushdown arenas with imperfect information [article]

Bastien Maubert, Aniello Murano, Olivier Serre
<span title="2020-07-30">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Previous work on SLiR focused on finite systems, and showed that the model-checking problem is decidable when information on the control states of the system is hierarchical among the players or components  ...  Such automata are undecidable, but semi-alternating pushdown tree automata were introduced and proved decidable, to study a strategic problem on pushdown systems with two players.  ...  A partial path is a finite non-empty 27 Then push 2 (θ) and push 3 (θ) are respectively REASONING ABOUT STRATEGIES ON COLLAPSIBLE PUSHDOWN ARENAS 27 The collapse operation is defined only when the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.15458v1">arXiv:2007.15458v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gnf5aimhrvatha4s6j27ruqtj4">fatcat:gnf5aimhrvatha4s6j27ruqtj4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200804054815/https://arxiv.org/pdf/2007.15458v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c5/de/c5de74af626e6d59ae5bbc9b1bae82c2fba7cd64.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.15458v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

On the Satisfiability Problem for SPARQL Patterns

Xiaowang Zhang, Jan Van den Bussche, François Picalausa
<span title="2016-07-18">2016</span> <i title="AI Access Foundation"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4ax4efcwajcgvidb6hcg6mwx4a" style="color: black;">The Journal of Artificial Intelligence Research</a> </i> &nbsp;
The satisfiability problem for SPARQL 1.0 patterns is undecidable in general, since the relational algebra can be emulated using such patterns.  ...  When no inconsistent filter conditions can be formed, satisfiability is decidable by syntactic checks on bound variables and on the use of literals.  ...  Acknowledgment We thank the anonymous referees, both on the original submission and on the revised submission, for their critical comments, which encouraged us to significantly improve the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1613/jair.5028">doi:10.1613/jair.5028</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7av3tepearf73jazv6syer4uja">fatcat:7av3tepearf73jazv6syer4uja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190427032352/https://uhdspace.uhasselt.be/dspace/bitstream/1942/21878/1/live-5028-9408-jair.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b8/24/b824e22ddea7b99467946c562a0fae3e00277d5a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1613/jair.5028"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Reasoning about Others' Reasoning

Larbi Alaoui, Katharina A. Janezic, Antonio Penta
<span title="">2020</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/sj24t22gfnfprddmjorsfd6flq" style="color: black;">Journal of Economic Theory</a> </i> &nbsp;
Rather, there is an interaction between own cognitive bound and reasoning about the opponent's reasoning process.  ...  In this paper we provide a simple experimental design strategy (the 'tutorial method') to disentangle the two concepts purely based on subjects' choices.  ...  beliefs about opponents' cognitive abilities, and reasoning about the opponents' reasoning processes.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jet.2020.105091">doi:10.1016/j.jet.2020.105091</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7etfc3t2pvgr7lvnt4kosalqku">fatcat:7etfc3t2pvgr7lvnt4kosalqku</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200814040906/https://pdf.sciencedirectassets.com/272399/1-s2.0-S0022053120X00044/1-s2.0-S0022053120300855/main.pdf?X-Amz-Security-Token=IQoJb3JpZ2luX2VjEMP%2F%2F%2F%2F%2F%2F%2F%2F%2F%2FwEaCXVzLWVhc3QtMSJIMEYCIQCR0kRXq1WnD5NU0AkElCylFQYVEoZ4gEXDqAcRw7eyFQIhAOdJ7WYLL926fSlnsZij136%2BAHBp3qEd3M7R7Sl6WZ1jKr0DCJz%2F%2F%2F%2F%2F%2F%2F%2F%2F%2FwEQAxoMMDU5MDAzNTQ2ODY1Igwhfa2z0GDrGO6m0w0qkQPYrINr0XqEgyuTk1rljYC%2B3MTI0omwZYicN4cShbxjM8oU4SNfbpcgpzVqSehbYCiukpKsmZ3TwN3gpPzlT7pwc6Lu13b2qSKhRx1HfbxdqI0jqb0A0QzTy%2BXRxbQpezPPlm21EvtpNSrmPWHRwZAGkpdlmUT5HlYWuMpDVVksALbC9q0k6xJkLC%2BY1ebGFZW0i8bzpK5aK4Q%2BSxexyz21g7lZfJxBifxAYefXi87BMYLfTraNgBXniyqWFW3dAl7c209IVliG1BJmKOgK97QBegDDY6FhG9jcMaATN4%2FzR%2BxNcPH9nMTlDf1rummA0%2FdZKaMOB9C0YLuVBJmxVDT6OWnF9daxNaRyOJxCXnxl8QTZVrNAtFwmyPbJLdtgPZR1I7cxdI5K3PaMd79VO%2FS9cFFhPDC0VLVZE7Gl8EyXgETkdtB28u7j9E1qYdlFdkKE0CGQ5te0eKPxEDQAnHajAShi7%2B8a8v1snP0AGDuDQ0ZW62DKwgHBm01oe6hiNNAJxVJBIXknLW2uzh%2FSjc2OIDCD%2FNf5BTrqAU6wep1AVqJ%2BTZ8d9awWfsPMK9Q2LkENM8Rcu7IaGLcRXsm%2BpsbKfXLrrogdW0iGBf40gr1TwW5FR8yiCMb0hHRcdmJQDBpqYU7arwFfEF9VWRTvzojzfJD%2BF1mT34zI0pkIY7T3s%2B7a1OTlw8MACK2yy4DvNVLJH1p%2FJszZwEk1p6yXLScnAmoifuAZIcETsmOE97EZR1PyS4fSUhUOaA6%2Focvy9YBL1X8E0cXRI0kFU3iArN6LLdA%2FpEyrTzUoU6xRY6ekdZhj5L9DjCwSjfqlggB%2F48UUOBfRqEhLXMSnUD%2BDsJaABuyacw%3D%3D&amp;X-Amz-Algorithm=AWS4-HMAC-SHA256&amp;X-Amz-Date=20200814T040900Z&amp;X-Amz-SignedHeaders=host&amp;X-Amz-Expires=300&amp;X-Amz-Credential=ASIAQ3PHCVTY6DJ5OB5K%2F20200814%2Fus-east-1%2Fs3%2Faws4_request&amp;X-Amz-Signature=da1918e4ddc3e0fb62fa7a415bfe7743f19f816681dac9ca6201dcb24ec9bb50&amp;hash=4fe29757e8ec1e14eab479ec4473adf361836ca16e0d5110b76bf12c9d004820&amp;host=68042c943591013ac2b2430a89b270f6af2c76d8dfd086a07176afe7c76c2c61&amp;pii=S0022053120300855&amp;tid=spdf-28e18c94-12e0-4913-a152-a2ba86c33b0a&amp;sid=32d39e941742534c863a249900683f5fb151gxrqa&amp;type=client" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jet.2020.105091"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Reasoning about memoryless strategies under partial observability and unconditional fairness constraints

Simon Busard, Charles Pecheur, Hongyang Qu, Franco Raimondi
<span title="">2015</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
Abstract Alternating-time Temporal Logic (ATL) is a logic to reason about strategies that a set of agents can adopt to achieve a specified collective goal.  ...  Integration of these three concepts is of particular importance when reasoning about the capabilities of agents that do not have full knowledge of a system, for instance when the agents can assume that  ...  Acknowledgments Thanks are due to Pierre-Yves Schobbens and Jean-François Raskin for inspiring discussions about AT L and its variants, and games and memory of strategies.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2015.03.014">doi:10.1016/j.ic.2015.03.014</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s47kcjmzgzcv5n7tghixykzhve">fatcat:s47kcjmzgzcv5n7tghixykzhve</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180724041328/http://eprints.whiterose.ac.uk/94360/1/sr13-journal.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9a/b7/9ab76f64a87295247eda4690bb7797c3dffdb893.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2015.03.014"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 874,351 results