8512 search results - page 202 / 1703 » Computing Theory With Relevance |
117
click to vote
SEMWEB
2007
Springer
15 years 11 months ago
2007
Springer
In this paper we propose a new tool called OWL-CM (OWL Combining Matcher) that deals with uncertainty inherent to ontology mapping process. On the one hand, OWL-CM uses the techniq...
175
Voted
SOCO
2007
Springer
15 years 11 months ago
2007
Springer
In the context of Service Oriented Computing, contracts are descriptions of the externally observable behaviour of services. Given a group of collaborating services, their contract...
145
click to vote
FOSSACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
134
click to vote
ICAIL
2003
ACM
15 years 10 months ago
2003
ACM
Defeasible Logic is a promising representation for legal knowledge that appears to overcome many of the deficiencies of previous approaches to representing legal knowledge. Unfor...
120
click to vote
COMPSAC
2009
IEEE
15 years 9 months ago
2009
IEEE
Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theor...