Sciweavers

482 search results - page 88 / 97
» Expressive probabilistic description logics
Sort
View
AMAI
2004
Springer
14 years 1 months ago
Using Automatic Case Splits and Efficient CNF Translation to Guide a SAT-solver when Formally Verifying Out-Of-Order Processors
The paper integrates automatically generated case-splitting expressions, and an efficient translation to CNF, in order to formally verify an out-of-order superscalar processor havi...
Miroslav N. Velev
DOLAP
2000
ACM
13 years 12 months ago
Automatically Generating OLAP Schemata from Conceptual Graphical Models
Generating tool specific schemata and configuration information for OLAP database tools from conceptual graphical models is an important prerequisite for a comprehensive tool supp...
Karl Hahn, Carsten Sapia, Markus Blaschka
ECEASST
2008
121views more  ECEASST 2008»
13 years 7 months ago
Analyzing Semantic Properties of OCL Operations by Uncovering Interoperational Relationships
The OCL (Object Constraint Language) as part of the UML (Unified Modeling Language) is a rich language with different collection kinds (sets, multi-sets, sequences) and a large var...
Mirco Kuhlmann, Martin Gogolla
LICS
2009
IEEE
14 years 2 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
ICIW
2008
IEEE
14 years 2 months ago
DBOWL: Towards a Scalable and Persistent OWL Reasoner
—With the increasing development of real applications using Semantic Web Technologies, it is necessary to provide scalable and efficient ontology querying and reasoning systems....
María del Mar Roldán García, ...