Sciweavers

2062 search results - page 48 / 413
» Derivatives of Logical Formulas
Sort
View
LICS
2006
IEEE
15 years 11 months ago
The Boundedness Problem for Monadic Universal First-Order Logic
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
Martin Otto
JANCL
2008
170views more  JANCL 2008»
15 years 5 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
APAL
2006
89views more  APAL 2006»
15 years 5 months ago
On modal logic of deductive closure
A new modal logic D is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic D is proven to be dec...
Pavel Naumov
EXACT
2008
15 years 7 months ago
Deriving Explanations From Partial Temporal Information
The representation and manipulation of natural human understanding of temporal phenomena is a fundamental field of study in Computer Science, which aims both to emulate human think...
Jixin Ma, Brian Knight, Miltos Petridis
CORR
2008
Springer
113views Education» more  CORR 2008»
15 years 5 months ago
Asymptotics of Entropy Rate in Special Families of Hidden Markov Chains
We generalize a result in [8] and derive an asymptotic formula for entropy rate of a hidden Markov chain around a "weak Black Hole". We also discuss applications of the ...
Guangyue Han, Brian Marcus