19 search results - page 2 / 4 » Deciding Local Theory Extensions via E-matching |
KR
1992
Springer
13 years 8 months ago
1992
Springer
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
ICFP
2007
ACM
14 years 4 months ago
2007
ACM
As a means of transmitting not only data but also code encapsulated within functions, higher-order channels provide an advanced form of task parallelism in parallel computations. ...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...