232 search results - page 19 / 47 » Completeness and Decidability in Sequence Logic |
ICDAR
2005
IEEE
14 years 3 months ago
2005
IEEE
In this article, we focus on the problem of caption detection in video sequences. Contrary to most of existing approaches based on a single detector followed by an ad hoc and cost...
CIE
2009
Springer
14 years 4 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
CADE
2001
Springer
14 years 10 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
MLQ
2007
13 years 9 months ago
2007
It is well known that MTL satisfies the finite embeddability property. Thus MTL is complete w.r.t. the class of all finite MTL-chains. In order to reach a deeper understanding ...
FMCAD
2009
Springer
14 years 4 months ago
2009
Springer
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...