503 search results - page 50 / 101 » Combining Description Logics, Description Graphs, and Rules |
SEMWEB
2004
Springer
14 years 1 months ago
2004
Springer
OWL DL corresponds to a Description Logic (DL) that is a fragment of classical first-order predicate logic (FOL). Therefore, the standard methods of automated reasoning for full F...
COMPASS
1994
13 years 12 months ago
1994
We give a notation and a logical calculus for the description and deductive manipulation of dynamic networks of communicating components. We represent such nets by hierarchical sys...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
GLVLSI
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper proposes a library-free technology mapping algorithm to reduce delay in combinational circuits. The algorithm reduces the overall number of series transistors through t...
ICALP
2010
Springer
14 years 16 days ago
2010
Springer
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....