34 search results - page 6 / 7 » Optimal Rewritings in Definitorially Complete Description Lo... |
138
click to vote
CSCLP
2008
Springer
15 years 1 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
133
click to vote
RR
2010
Springer
14 years 10 months ago
2010
Springer
Role-based access control is a standard mechanism in information systems. Based on the role a user has, certain information is kept from the user even if requested. For ontologies ...
ICCAD
2006
IEEE
15 years 8 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
112
click to vote
WISE
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
DLOG
2010
14 years 9 months ago
2010
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...