Sciweavers

3032 search results - page 174 / 607
» Description Logic Rules
Sort
View
EEE
2005
IEEE
15 years 6 months ago
SLA Representation, Management and Enforcement
As the IT industry is becoming more and more interested in service oriented business models and upcoming technologies like Web Services or Grid Computing, the need for automated c...
Adrian Paschke, Martin Bichler
89
Voted
CADE
1998
Springer
15 years 4 months ago
Strict Basic Superposition
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
80
Voted
ICCAD
1996
IEEE
92views Hardware» more  ICCAD 1996»
15 years 4 months ago
Generation of BDDs from hardware algorithm descriptions
We propose a new method for generating BDDs from hardware algorithm descriptions written in a programming language. Our system can deal with control structures, such as conditiona...
Shin-ichi Minato
144
Voted
INLG
2010
Springer
14 years 10 months ago
Generating Natural Language Descriptions of Z Test Cases
Critical software most often requires an independent validation and verification (IVV). IVV is usually performed by domain experts, who are not familiar with specific, many times ...
Maximiliano Cristiá, Brian Plüss
IJAC
2010
231views more  IJAC 2010»
14 years 10 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa