1331 search results - page 107 / 267 » Description logic reasoning using the PTTP approach |
178
click to vote
PEPM
2009
ACM
16 years 3 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
164
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
183
click to vote
SAC
2006
ACM
15 years 6 months ago
2006
ACM
The paper presents an ontology-based approach to service discovery, apt to support flexible and efficient matchmaking between service descriptions. We propose a hybrid approach th...
190
click to vote
DKE
2007
15 years 6 months ago
2007
ct 9 The benefits of modular representations are well known from many areas of computer science. While in software engi10 neering modularization is mainly a vehicle for supporting...
180
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...