Sciweavers

3032 search results - page 347 / 607
» Description Logic Rules
Sort
View
WWW
2004
ACM
16 years 4 months ago
A possible simplification of the semantic web architecture
In the semantic web architecture, Web ontology languages are built on top of RDF(S). However, serious difficulties have arisen when trying to layer expressive ontology languages, ...
Bernardo Cuenca Grau
ICCAD
1997
IEEE
99views Hardware» more  ICCAD 1997»
15 years 8 months ago
High-level area and power estimation for VLSI circuits
High-level power estimation, when given only a high-level design specification such as a functional or RTL description, requires high-level estimation of the circuit average acti...
Mahadevamurty Nemani, Farid N. Najm
PLDI
2011
ACM
14 years 6 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
DLOG
2003
15 years 5 months ago
Implementing Matching in ALE--First Results
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
Sebastian Brandt
255
Voted
POPL
2004
ACM
16 years 4 months ago
Separation and information hiding
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
Peter W. O'Hearn, Hongseok Yang, John C. Reynolds