1486 search results - page 181 / 298 » A Logically Saturated Extension of |
133
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
206
click to vote
DLOG
2011
14 years 9 months ago
2011
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
270
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
184
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
148
Voted
ICWS
2009
IEEE
16 years 3 months ago
2009
IEEE
Abstract—Several approaches have been proposed to introduce self-management capabilities for web service compositions. However, most of these works are limited as they are not ex...