287 search results - page 34 / 58 » Automated abstraction of class diagrams |
LPAR
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
CSL
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
ECSQARU
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpret...
ECSQARU
2001
Springer
14 years 1 days ago
2001
Springer
Abstract A (general) preferential entailment is defined by a “preference relation” among “states”. States can be either interpretations or sets of interpretations, or “c...
CL
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simul...