Sciweavers

132 search results - page 9 / 27
» Lower bounds for modal logics
Sort
View
85
Voted
APAL
2004
81views more  APAL 2004»
14 years 10 months ago
The complexity of first-order and monadic second-order logic revisited
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...
Markus Frick, Martin Grohe
110
Voted
WOLLIC
2010
Springer
15 years 3 months ago
Modal Logics with Counting
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
Carlos Areces, Guillaume Hoffmann, Alexandre Denis
SAT
2010
Springer
178views Hardware» more  SAT 2010»
15 years 2 months ago
Proof Complexity of Propositional Default Logic
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...
Olaf Beyersdorff, Arne Meier, Sebastian Mülle...
BIRTHDAY
2003
Springer
15 years 3 months ago
Bounded Fairness
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
Nachum Dershowitz, D. N. Jayasimha, Seungjoon Park
65
Voted
MLQ
2008
54views more  MLQ 2008»
14 years 10 months ago
A localic theory of lower and upper integrals
An account of lower and upper integration is given. It is constructive in the sense of geometric logic. If the integrand takes its values in the nonnegative lower reals, then its ...
Steven Vickers