611 search results - page 54 / 123 » Index Sets of Computable Structures with Decidable Theories |
126
click to vote
RTA
1993
Springer
15 years 8 months ago
1993
Springer
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...
106
click to vote
ACL
1998
15 years 5 months ago
1998
Abstract Resource adaptlvity" Because the sets of strucNatural language parsing is conceived to be a procedure of disambiguation, which successively reduces an initially total...
138
click to vote
WWW
2002
ACM
16 years 4 months ago
2002
ACM
Multimedia scheduling models provide a rich variety of tools for managing the synchronization of media like video and audio, but generally have an inflexible model for time itself...
141
click to vote
APN
2010
Springer
15 years 4 months ago
2010
Springer
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing p...
170
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...