Sciweavers

144 search results - page 13 / 29
» Complexity Results for Modal Dependence Logic
Sort
View
FCT
2003
Springer
15 years 4 months ago
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
Andrzej Szalas
ATAL
2009
Springer
15 years 6 months ago
Rational play and rational beliefs under uncertainty
Alternating-time temporal logic (atl) is one of the most influential logics for reasoning about agents’ abilities. Constructive Strategic Logic (csl) is a variant of atl for im...
Nils Bulling, Wojciech Jamroga
APAL
2010
115views more  APAL 2010»
14 years 11 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev
ECAI
2010
Springer
15 years 24 days ago
Optimal Tableaux for Conditional Logics with Cautious Monotonicity
Conditional logics capture default entailment in a modal framework in which non-monotonic implication is a first-class citizen, and in particular can be negated and nested. There i...
Lutz Schröder, Dirk Pattinson, Daniel Hausman...
ICFP
2002
ACM
15 years 11 months ago
Meta-programming with names and necessity
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
Aleksandar Nanevski