644 search results - page 113 / 129 » Precedence Automata and Languages |
154
click to vote
ICFP
2005
ACM
16 years 5 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
134
click to vote
CAV
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another....
147
Voted
LATA
2009
Springer
16 years 4 days ago
2009
Springer
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
153
click to vote
RWEB
2009
Springer
15 years 12 months ago
2009
Springer
In this chapter we will introduce description logics, a family of logic-based knowledge representation languages that can be used to represent the terminological knowledge of an a...
179
Voted
WISE
2006
Springer
15 years 11 months ago
2006
Springer
Service composition is becoming the dominant paradigm for developing Web service applications. It is important to ensure that a service composition complies with the requirements f...