43 search results - page 4 / 9 » Persistence and Type Abstraction Revisited |
AUSAI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We provide a conceptual analysis of several kinds of deadlines, represented in Temporal Modal Defeasible Logic. The paper presents a typology of deadlines, based on the f...
CSREAESA
2006
13 years 8 months ago
2006
- A systematic approach to building layered software architecture is proposed. Separate layering models required oper abstracting of hardware, persistent data, and communication pr...
CAISE
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Parthood is a relation of fundamental importance in a number of disciplines including cognitive science, linguistics and conceptual modeling. However, one classical probl...
EVOW
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
ECEASST
2010
13 years 4 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...