Filters








110,019 Hits in 3.3 sec

A Decidable Fragment of Strategy Logic [article]

Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi
2012 arXiv   pre-print
This logic is a syntactic fragment of SL, strictly subsuming ATL*, which encompasses formulas in prenex normal form having a single temporal goal at a time, for every strategy quantification of agents.  ...  In order to obtain a decidable sublogic, we introduce and study here One-Goal Strategy Logic (SL[1G], for short).  ...  Then, define the components 24 of U Ac ♭ψ One-Goal Strategy Logic (SL[1G], for short), as a syntactic fragment of SL, which we also report here for technical reasons.  ... 
arXiv:1202.1309v2 fatcat:4ikknomn3vf35dt4ygbbffi7xm

What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic [chapter]

Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi
2012 Lecture Notes in Computer Science  
Specifically, we introduce and study the syntactic fragment One-Goal Strategy Logic (SL[1G], for short), which consists of formulas in prenex normal form having a single temporal goal at a time for every  ...  An obvious question that arises is then what makes ATL * decidable. Understanding this should enable us to identify decidable fragments of SL.  ...  Hence, a natural question that arises is what makes ATL * decidable. Understanding the reasons for the decidability of ATL * should enable us to identify decidable fragments of SL.  ... 
doi:10.1007/978-3-642-32940-1_15 fatcat:d3rdgrnatrda3iansx6lrvxr7q

Page 1835 of Mathematical Reviews Vol. , Issue 94d [page]

1994 Mathematical Reviews  
In this article, we present a powerful new strategy, called the kernel strategy, for studying fragments in the context of questions concerned with fixed point properties.  ...  Rather than studying all of the logic, logicians often focus on fragments of the logic, subsets whose basis is obtained by replacing S or K or both by other combina- tors.  ... 

A Finite Model Property for Gödel Modal Logics [chapter]

Xavier Caicedo, George Metcalfe, Ricardo Rodríguez, Jonas Rogger
2013 Lecture Notes in Computer Science  
A similar strategy is used to establish decidability, and indeed co-NP-completeness, for the crisp Gödel modal logic GS5 C based on S5 frames where accessibility is an equivalence relation.  ...  This finite model property fails for the box fragment of GK and GK C and the diamond fragment of GK C , but decidability and PSPACE-completeness for these fragments was established in [11, 12] using  ... 
doi:10.1007/978-3-642-39992-3_20 fatcat:g5c3e66o4vaqvpwihtixo4qncm

Realizing $$\omega $$-regular Hyperproperties [chapter]

Bernd Finkbeiner, Christopher Hahn, Jana Hofmann, Leander Tentrup
2020 Lecture Notes in Computer Science  
projection of the fragment to HyperLTL has a decidable realizability problem.  ...  At the same time, we argued that the expressiveness of HyperQPTL is optimal in a sense that a more expressive logic for ω-regular hyperproperties would have an undecidable model checking problem.  ...  Furthermore, satisfiability is decidable for large fragments of the logic [6] . Decidable HyperQPTL fragments can be described solely in terms of their trace quantifier prefix.  ... 
doi:10.1007/978-3-030-53291-8_4 fatcat:nx45so3bxnb2zgubj4anbr77t4

Probabilistic Strategy Logic

Benjamin Aminof, Marta Kwiatkowska, Bastien Maubert, Aniello Murano, Sasha Rubin
2019 Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence  
We introduce Probabilistic Strategy Logic, an extension of Strategy Logic for stochastic systems.  ...  We identify a natural fragment of the logic, in which every temporal operator is immediately preceded by a probabilistic operator, and show that it is decidable in space exponential in the system and the  ...  Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence  ... 
doi:10.24963/ijcai.2019/5 dblp:conf/ijcai/AminofKMMR19 fatcat:k3po3wogh5hsljscok6mgcos3u

On Unary Fragments of MTL and TPTL over Timed Words [chapter]

Khushraj Madnani, Shankara Narayanan Krishna, Paritosh K. Pandya
2014 Lecture Notes in Computer Science  
These Logics are extension of LTL that allow timing constraints to be specified along with the temporal ordering.  ...  These Logics are extension of LTL that allow timing constraints to be specified along with the temporal ordering.  ...  Khushraj Madnani,S.N.Krishna, Paritosh.K.PandyaOn Unary Fragments of MTL and TPTL over Timed Words.  ... 
doi:10.1007/978-3-319-10882-7_20 fatcat:mgjzezczrner7pb7lxwgddh7i4

Finite Satisfiability of Unary Negation Fragment with Transitivity (Extended Abstract)

Daniel Danielski, Emanuel Kieronski
2019 International Workshop on Description Logics  
This has been explicitly stated in [10] , as a corollary from the decidability of UNFO with regular path expressions, and follows also from [1] , where some extensions of the guarded negation fragment  ...  Searching for attractive fragments of first-order logic is an important theme in theoretical computer science.  ...  This is sufficient, in particular, to imply the decidability of FOMQA for the logic SHOI , which, up to our knowledge, is a new result.  ... 
dblp:conf/dlog/DanielskiK19 fatcat:gqyexz2qsnarbn5gpcticx3gsq

Finite Model Theory of the Triguarded Fragment and Related Logics (Extended Abstract)

Emanuel Kieronski, Sebastian Rudolph
2021 International Workshop on Description Logics  
As typical for decidable fragments of first-order logic we introduce a normal form for TGF formulas, similar to those used, e.g., for GF [4] and FO 2 [5] .  ...  Ever since first-order logic (FOL) was found to have an undecidable satisfiability problem, researchers have attempted to identify expressive yet decidable fragments of FOL and pinpoint their complexity  ... 
dblp:conf/dlog/KieronskiR21 fatcat:osrhubhssrhw7kkhgbkgd5qfcq

An Event-Based Fragment of First-Order Logic over Intervals

Savas Konur
2010 Journal of Logic, Language and Information  
This result shows that even a simple decidable fragment of first-order logic has NEXPTIME complexity.  ...  Considering such a fragment of first-order logic is motivated by defining a general framework for event-based interval temporal logics.  ...  By studying the logic EF, we are able to investigate a new decidable fragment of first-order logic (FOL). In the literature, there are various decidable fragments of FOL.  ... 
doi:10.1007/s10849-010-9126-5 fatcat:6jgzl6ugcnhezgutfmdqqrwm7y

Guards, Bounds, and Generalized Semantics

Johan van Benthem
2005 Journal of Logic, Language and Information  
We also show how a perspective shift to general assignment models provides a new look at the fixed-point extension LFP(FO) of first-order logic, making it decidable.  ...  , which are essentially in the Bounded Fragment of many-sorted first-order logic.  ...  Guards in second-order logic Lowering complexity in higher-order logic Guarding was introduced for making first-order logic decidable -but strategies for lowering complexity of logics have been around  ... 
doi:10.1007/s10849-005-5786-y fatcat:wejrrgf2qfd6lduis4nrs73iqa

Page 5143 of Mathematical Reviews Vol. , Issue 2004g [page]

2004 Mathematical Reviews  
In particular, we prove decidability of hyperresolution with or without splitting for the fragment GF1~ and point out several ways of extending this fragment without losing decidability.  ...  However, we show that there are natural fragments of the guarded fragment which can be decided by hyper- resolution.  ... 

Verifying Systems of Resource-Bounded Agents [chapter]

Natasha Alechina, Brian Logan
2016 Lecture Notes in Computer Science  
However such approaches often ignore a key aspect of multi-agent systems, namely that the agents' actions require (and sometimes produce) resources.  ...  Approaches to the verification of multi-agent systems are typically based on games or transition systems defined in terms of states and actions.  ...  In [3] , a new syntactic fragment of resource logic RAL with decidable modelchecking has been identified.  ... 
doi:10.1007/978-3-319-40189-8_1 fatcat:ygwqpdauzrd35g37tqvxbwanfi

A PSPACE-Complete First Order Fragment of Computability Logic [article]

Matthew S. Bauer
2013 arXiv   pre-print
Furthermore, the fragment of CL4 not containing blind quantifiers was shown to be decidable in polynomial space.  ...  In a recently launched research program for developing logic as a formal theory of (interactive) computability, several very interesting logics have been introduced and axiomatized.  ...  A predicate can be seen to be decidable if and only if ⊤ has a winning strategy for this game.  ... 
arXiv:1201.4856v3 fatcat:a5akh2sy7rc4hdh6xaukfhyzom

Satisfiability in Strategy Logic Can Be Easier than Model Checking

Erman Acar, Massimo Benerecetti, Fabio Mogavero
2019 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
The result is obtained by means of an elegant encoding of the problem into the satisfiability of conjunctive-binding first-order logic, a recently discovered decidable fragment of first-order logic.  ...  In this paper, we investigate the connection between the two problems for a non-trivial fragment of Strategy Logic (SL, for short).  ...  Flat Strategy Logic Fragment Strategy Logic (Chatterjee, Henzinger, and Piterman 2007; Mogavero, Murano, and Vardi 2010) is extension of LTL with first-order strategy quantifications ∃x and ∀x and agent  ... 
doi:10.1609/aaai.v33i01.33012638 fatcat:sveqeqhwmnekzdmzag5ji422uq
« Previous Showing results 1 — 15 out of 110,019 results