Sciweavers

498 search results - page 41 / 100
» A Formal Foundation for ODRL
Sort
View
JSYML
2007
79views more  JSYML 2007»
14 years 9 months ago
Models of non-well-founded sets via an indexed final coalgebra theorem
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of ...
Federico De Marchi, Benno van den Berg
WWW
2005
ACM
15 years 10 months ago
Soundness proof of Z semantics of OWL using institutions
The correctness of the Z semantics of OWL is the theoretical foundation of using software engineering techniques to verify Web ontologies. As OWL and Z are based on different logi...
Dorel Lucanu, Yuan-Fang Li, Jin Song Dong
CAISE
2007
Springer
15 years 4 months ago
Modal Aspects of Object Types and Part-Whole Relations and the de re/de dicto Distinction
In a series of publications, we have proposed a foundational system of ontological categories which has been used to evaluate and improve the quality of conceptual modeling languag...
Giancarlo Guizzardi
AMAST
2004
Springer
15 years 3 months ago
Behavioural Types and Component Adaptation
Component adaptation is widely recognised to be one of the crucial problems in Component-Based Software Engineering. The objective of this paper is to set a formal foundation for t...
Antonio Brogi, Carlos Canal, Ernesto Pimentel
BPM
2003
Springer
91views Business» more  BPM 2003»
15 years 3 months ago
Business Process Management: A Survey
Abstract. Business Process Management (BPM) includes methods, techniques, and tools to support the design, enactment, management, and analysis of operational business processes. It...
Wil M. P. van der Aalst, Arthur H. M. ter Hofstede...