Sciweavers

96 search results - page 4 / 20
» A lower bound for intuitionistic logic
Sort
View
APAL
2004
81views more  APAL 2004»
13 years 7 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
JSYML
2007
85views more  JSYML 2007»
13 years 7 months ago
Substructural fuzzy logics
Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0, 1]. In this paper, we introduce Un...
George Metcalfe, Franco Montagna
SAT
2010
Springer
178views Hardware» more  SAT 2010»
13 years 11 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...
MLQ
2008
54views more  MLQ 2008»
13 years 7 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
DLOG
2010
13 years 6 months ago
Optimal Rewritings in Definitorially Complete Description Logics
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
Inanç Seylan, Enrico Franconi, Jos de Bruij...