Sciweavers

2062 search results - page 48 / 413
» Derivatives of Logical Formulas
Sort
View
125
Voted
LICS
2006
IEEE
15 years 6 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
98
Voted
JANCL
2008
170views more  JANCL 2008»
15 years 15 days 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
75
Voted
APAL
2006
89views more  APAL 2006»
15 years 18 days 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
105
Voted
EXACT
2008
15 years 2 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
93
Voted
CORR
2008
Springer
113views Education» more  CORR 2008»
15 years 18 days 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