Sciweavers

41 search results - page 5 / 9
» csl 2008
Sort
View
CSL
2008
Springer
13 years 7 months ago
Syntactic Metatheory of Higher-Order Subtyping
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
Andreas Abel, Dulma Rodriguez
CSL
2008
Springer
13 years 7 months ago
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
Ian Hodkinson, Angelo Montanari, Guido Sciavicco
CSL
2008
Springer
13 years 5 months ago
Tone-enhanced generalized character posterior probability (GCPP) for Cantonese LVCSR
Tone-enhanced, generalized character posterior probability (GCPP), a generalized form of posterior probability at subword (Chinese character) level, is proposed as a rescoring met...
Yao Qian, Frank K. Soong, Tan Lee
CSL
2008
Springer
13 years 7 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
CSL
2008
Springer
13 years 7 months ago
Extensional Uniformity for Boolean Circuits
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...
Pierre McKenzie, Michael Thomas, Heribert Vollmer