Sciweavers

2022 search results - page 8 / 405
» Complexity of Non-Monotonic Logics
Sort
View
ICALP
1998
Springer
15 years 2 months ago
Difficult Configurations - On the Complexity of LTrL
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
Igor Walukiewicz
JCST
2010
189views more  JCST 2010»
14 years 4 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
JAPLL
2010
133views more  JAPLL 2010»
14 years 8 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
AAAI
2012
13 years 14 days ago
Learning Games from Videos Guided by Descriptive Complexity
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speciï...
Lukasz Kaiser
CSL
2010
Springer
14 years 11 months ago
Complexity Results for Modal Dependence Logic
Modal dependence logic was introduced very recently by V
Peter Lohmann, Heribert Vollmer