Complexity Results of STIT Fragments
Studia Logica 100 (5):1001-1045 (2012)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesPhilippe Balbiani, Andreas Herzig & Nicolas Troquard (2008). Alternative Axiomatics and Complexity of Deliberative Stit Theories. Journal of Philosophical Logic 37 (4).
Michael Perloff (1991). Stit and the Language of Agency. Synthese 86 (3):379 - 408.
Ming Xu (forthcoming). Combinations of Stit and Actions. Journal of Logic, Language and Information.
Ming Xu (1995). On the Basic Logic of STIT with a Single Agent. Journal of Symbolic Logic 60 (2):459-483.
Carlos Areces, Patrick Blackburn & Maarten Marx (2001). Hybrid Logics: Characterization, Interpolation and Complexity. Journal of Symbolic Logic 66 (3):977-1010.
W. J. Blok & J. G. Raftery (2004). Fragments of R-Mingle. Studia Logica 78 (1-2):59 - 106.
Kevin Davey (2002). Obligation and the Conditional in Stit Theory. Studia Logica 72 (3):339-362.
Doron Sonsino & Marvin Mandelbaum (2001). On Preference for Flexibility and Complexity Aversion: Experimental Evidence. Theory and Decision 51 (2/4):197-216.
Nadia Creignou, Johannes Schmidt, Michael Thomas & Stefan Woltran (2011). Complexity of Logic-Based Argumentation in Post's Framework. Argument and Computation 2 (2-3):107 - 129.
Beth Huffer (2007). Actions and Outcomes: Two Aspects of Agency. Synthese 157 (2):241 - 265.
Luca Anderlini & Leonardo Felli (1999). Incomplete Contracts and Complexity Costs. Theory and Decision 46 (1):23-50.
Peter Lohmann & Heribert Vollmer (2013). Complexity Results for Modal Dependence Logic. Studia Logica 101 (2):343-366.
Hans-Jorg Rheinberger (1997). Experimental Complexity in Biology: Some Epistemological and Historical Remarks. Philosophy of Science 64 (4):254.
Jan Krajíček (1995). Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press.
Analytics
Monthly downloads |
Added to index2012-09-27Total downloads2 ( #232,316 of 549,013 )Recent downloads (6 months)2 ( #37,272 of 549,013 )How can I increase my downloads? |
My notes
Discussion
