3440 search results - page 128 / 688 » Logics For Context-Free Languages |
154
click to vote
DEXAW
2008
IEEE
16 years 1 months ago
2008
IEEE
Today’s high-speed network allows sophisticated applications of overlay networks. Meanwhile, usage of multicore processors has been spreading. The level of concurrency we need t...
271
click to vote
POPL
2002
ACM
16 years 7 months ago
2002
ACM
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
156
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
The paper presents a prototype of a system for querying the Web in natural language (French) for a limited domain. The domain knowledge, represented in description logics (DL), is ...
176
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
210
click to vote
ASP
2003
Springer
16 years 3 days ago
2003
Springer
Abstract. We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, feat...