Tractable Reasoning about Group Beliefs

2014 ◽  
pp. 328-350 ◽  
Author(s):  
Barbara Dunin-Kęplicz ◽  
Andrzej Szałas ◽  
Rineke Verbrugge
Keyword(s):  
Tractable Reasoning

Tractable Reasoning with Bayesian Description Logics

2008 ◽  
pp. 146-159 ◽  
Author(s):  
Claudia d’Amato ◽  
Nicola Fanizzi ◽  
Thomas Lukasiewicz
Keyword(s):  
Description Logics ◽  
Tractable Reasoning

scholarly journals Tractable reasoning via approximation

1995 ◽  
Vol 74 (2) ◽  
pp. 249-310 ◽  
Author(s):  
Marco Schaerf ◽  
Marco Cadoli
Keyword(s):  
Tractable Reasoning

scholarly journals Tractable Reasoning in a Fragment of Separation Logic

2011 ◽  
pp. 235-249 ◽  
Author(s):  
Byron Cook ◽  
Christoph Haase ◽  
Joël Ouaknine ◽  
Matthew Parkinson ◽  
James Worrell
Keyword(s):  
Separation Logic ◽  
Tractable Reasoning

scholarly journals Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

2007 ◽  
Vol 39 (3) ◽  
pp. 385-429 ◽  
Author(s):  
Diego Calvanese ◽  
Giuseppe De Giacomo ◽  
Domenico Lembo ◽  
Maurizio Lenzerini ◽  
Riccardo Rosati
Keyword(s):  
Description Logics ◽  
Query Answering ◽  
Tractable Reasoning

scholarly journals Consequence-based and fixed-parameter tractable reasoning in description logics

2014 ◽  
Vol 209 ◽  
pp. 29-77 ◽  
Author(s):  
František Simančík ◽  
Boris Motik ◽  
Ian Horrocks
Keyword(s):  
Description Logics ◽  
Fixed Parameter Tractable ◽  
Fixed Parameter ◽  
Tractable Reasoning

scholarly journals Strategy Logic with Simple Goals: Tractable Reasoning about Strategies

2019 ◽  
Author(s):  
Francesco Belardinelli ◽  
Wojciech Jamroga ◽  
Damian Kurpiewski ◽  
Vadim Malvone ◽  
Aniello Murano
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Computational Cost ◽  
Expressive Power ◽  
Game Theoretic ◽  
Strategy Logic ◽  
Tractable Reasoning

In this paper we introduce Strategy Logic with simple goals (SL[SG]), a fragment of Strategy Logic that strictly extends the well-known Alternating-time Temporal Logic ATL by introducing arbitrary quantification over the agents' strategies.  Our motivation comes from game-theoretic applications, such as expressing Stackelberg equilibria in games, coercion in voting protocols, as well as module checking for simple goals. Most importantly, we prove that the model checking problem for SL[SG] is PTIME-complete, the same as ATL. Thus, the extra expressive power comes at no computational cost as far as verification is concerned.

Sign in / Sign up

Export Citation Format

Share Document