644 search results - page 113 / 129 » Precedence Automata and Languages |
ICFP
2005
ACM
14 years 8 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...
CAV
2009
Springer
14 years 9 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....
LATA
2009
Springer
14 years 3 months 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 ...
RWEB
2009
Springer
14 years 3 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...
WISE
2006
Springer
14 years 2 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...