8196 search results - page 421 / 1640 » Computational Modeling and Complexity Science |
197
click to vote
STACS
2007
Springer
16 years 28 days ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
173
click to vote
ACMSE
2006
ACM
16 years 24 days ago
2006
ACM
Reconstructing networks from time series data is a difficult inverse problem. We apply two methods to this problem using co-temporal functions. Co-temporal functions capture mathe...
162
click to vote
FOCS
2005
IEEE
16 years 13 days ago
2005
IEEE
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
160
click to vote
RTA
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
189
click to vote
TLCA
2005
Springer
16 years 8 days ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...