Reasoning about agent programs using ATL-Like logics

&
In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 437--449 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Term-modal logics.Melvin Fitting, Lars Thalmann & Andrei Voronkov - 2001 - Studia Logica 69 (1):133-169.
Qualitative approximate behavior composition.Nitin Yadav & Sebastian Sardina - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 450--462.
Programs and logics.Anita Wasilewska - 1985 - Studia Logica 44 (2):125 - 137.
Dual Tableaux: Foundations, Methodology, Case Studies.Ewa Orlowska & Joanna Golinska-Pilarek - 2011 - Springer.
Modeling medical diagnosis: Logical and computer approaches.Kenneth F. Schaffner - 1981 - Synthese 47 (1):163 - 199.
Modelling communicating agents in timed reasoning logics.Brian Logan, Mark Jago & Natasha Alechina - 2006 - In U. Endriss & M. Baldoni (eds.), Declarative Agent Languages and Technologies 4. Springer.
An overview of tableau algorithms for description logics.Franz Baader & Ulrike Sattler - 2001 - Studia Logica 69 (1):5-40.
Epistemic closure and commutative, nonassociative residuated structures.Sebastian Sequoiah-Grayson - 2013 - Synthese 190 (1):113-128.
AI as complex information processing.Hideyuki Nakashima - 1999 - Minds and Machines 9 (1):57-80.
Relevant logic as a basis for paraconsistent epistemic logics.Gerson Zaverucha - 1992 - Journal of Applied Non-Classical Logics 2 (2):225-241.
Equational Reasoning in Non-Classical Logics.Marcelo Frias & Ewa Orlowska - 1998 - Journal of Applied Non-Classical Logics 8 (1-2):27-66.
Is “some-other-time” sometimes better than “sometime” for proving partial correctness of programs?Ildikó Sain - 1988 - Studia Logica 47 (3):279 - 301.
Second-order reasoning in description logics.Andrzej Szalas - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):517-530.
Decidability for some justification logics with negative introspection.Thomas Studer - 2013 - Journal of Symbolic Logic 78 (2):388-402.

Analytics

Added to PP
2014-01-28

Downloads
16 (#902,419)

6 months
9 (#301,354)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Add more references