287 search results - page 17 / 58 » Automated abstraction of class diagrams |
LACL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Kanazawa has shown that k-valued classical categorial grammars have the property of finite elasticity [1], which is a sufficient condition for learnability. He has also ...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
SOFTVIS
2003
ACM
14 years 23 days ago
2003
ACM
Whenever multiple representations or models of a system exist, there is the possibility of defining how they relate. In model driven software development, it is essential that th...
ER
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...