Kombinatorische Ressourcenallokation mit ökonomischen Koordinationsmechanismen

In dieser Arbeit wird sowohl die theoretische Weiterentwicklung als auch die praktische Umsetzung von ökonomischen Koordinationsmechanismen zur Allokation von Ressourcen untersucht. Es werden neue Koordinationsverfahren für die Allokation komplementärer und substitutionaler Ressourcen entwickelt und Wege zu ihrer Realisierung in Agentensystemen aufgezeigt. Dabei werden Fragen der ökonomischen Effizienz, der Anreizkompatibilität und der Effizienz der Informationsbeschaffung untersucht. Darüberhinaus wird die Anwendbarkeit der Verfahren in einem Produktionskontext und die Konsequenz ihres Einsatzes für die Gestaltung von Organisationsstrukturen diskutier

Dynamic Modeling of CIM Systems

. Dynamic Modeling is not a precise defined concept. Nevertheless, its ambiguity makes it appropriate to use in discussions about requirements for a modern modeling methodology. "Real" systems (as CIM systems are) tend to be complex and dynamic. Models of such systems (or better: of parts of such systems) should serve different purposes: They should allow to answer certain questions about the underlying system and it should be possible to integrate/combine/interconnect the models to answer more sophisticated questions or questions on a different level of abstraction (e.g., strategic management questions if the underlying models are models for supporting control decision on an operational level). "Dynamic" modeling might emphasize mainly three aspects: (1) the utilization of the model for representing systems (or parts of systems) with certain dynamic properties, (2) the embedding of the method into an iterated (and dynamic) modeling process, and (3), as CIM systems are "living" systems..

Economically-augmented job shop scheduling

We present economically augmented job shop scheduling (EJSP) as an example of a coordination problem among selfinterested agents with private information. We discuss its significance in modern organizational supply-web structures, analyze its complexity and present a specific type of combinatorial auctions as a solution mechanism. We relate EJSP to results from the area of economic mechanism design and especially emphasize the need for solution mechanisms, which give the agents no incentive to lie. This requirement is a significant extension to the side constraints that are usually considered in the scheduling literature

A Logical Interpretation of RDF

Preface – A Note to the Reader: This is a step towards a logic-based formalization of RDF. It grew out of the necessity to precisely capture the semantics of RDF schemata while developing an RDFbased modeling framework for web applications (XWMF). The rules and facts that are described in the following allow to validate RDF triple sets. This in itself is not very exciting (VRP could be used instead). It becomes, however, relevant, if schema constructs are required that restrict, modify or extend the initial semantics, as, for example, monotone inheritance or typed containers. In such cases, rules that allow a precise interpretation of introduced schema constructs can be used to extend the basic rule set provided here. If the rules are themself given as XML/RDF, this can be a natural extension of the preciseness of the semantic expressibility of RDF schema definitions, ie. each RDF schema definition (syntax) may be accompanied by a document defining its semantics “logically”. Here, this starts to become pretty interesting. It would, however, require to extend parsers with a logic inference engine (e.g., as has been done with SiLRI 1). Some more remarks on our philosophy: we tried to retain as much of the RDF “spirit” as possible. We avoided, for example, to introduce new meta constructs etc. We designed the rules in a way such that violations of constraints are explicitly detected (this avoids to leave the knowledge base in an inconsistent state as it may happen if negated facts would be asserted). In this way, the violatio

A Logical Interpretation of RDF

The Resource Description Framework (RDF) is intended to be used to capture and express the conceptual structure of information offered in the Web. Interoperability is considered to be an important enabler of future web applications. While XML supports syntactic interoperability, RDF is aimed at semantic interoperability. Interoperability is only given if different users/agents interpret an RDF data model in the same way. Important aspects of the RDF model are, however, expressed in prose which may lead to misunderstandings. To avoid this, capturing the intended semantics of RDF in first-order logic might be a valuable contribution and may provide RDF with a formalization allowing its full exploitation as a key ingredient of the evolving Semantic Web. This paper seeks to express the concepts and constraints of the RDF model in first-order logic