2944 search results - page 236 / 589 » Robust Semantic Construction |
181
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
202
click to vote
RTA
2007
Springer
16 years 29 days ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
180
click to vote
PPDP
2009
Springer
15 years 11 months ago
2009
Springer
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
152
click to vote
TASLP
2008
15 years 6 months ago
2008
Given a large audio database of music recordings, the goal of classical audio identification is to identify a particular audio recording by means of a short audio fragment. Even th...
183
click to vote
IAT
2007
IEEE
16 years 1 months ago
2007
IEEE
Arabic Language understanding (ALU) computing is considered an AI-hard task. In this paper, we propose an Agent model for ALU problem. This agent is detailed in this paper. An ALU...