This master thesis contains the basic information about knowledge and expert systems. The thesis contains theoretic text about architecture of the expert systems and representation knowledge. The text regarding on representation knowledge contains examples of different ways of knowledge representation for expert systems. In the next part is described the design and all functions of the expert systems. This expert system uses frames representation.

Les systèmes embarqués sont de plus en plus intégrés dans les applications temps réel actuelles. Ils sont généralement constitués de composants matériels et logiciels profondément Intégrés mais hétérogènes. Ces composants sont développés sous des contraintes très strictes. En conséquence, le travail des ingénieurs de conception est devenu plus difficile. Pour répondre aux normes de haute qualité dans les systèmes embarqués de nos jours et pour satisfaire aux besoins quotidiens de l'industrie, l'automatisation du processus de développement de ces systèmes prend de plus en plus d'ampleur. Un défi majeur est de développer une approche automatisée qui peut être utilisée pour la vérification intégrée et la validation de systèmes complexes et hétérogènes.Dans le cadre de cette thèse, nous proposons une nouvelle approche compositionnelle pour la modélisation et la vérification des systèmes complexes décrits en langage SystemC. Cette approche est basée sur le modèle des SystemC Waiting State Automata (WSA). Les SystemC Waiting State Automata sont des automates permettant de modéliser le comportement abstrait des systèmes matériels et logiciels décrits en SystemC tout en préservant la sémantique de l'ordonnanceur SystemC au niveau des cycles temporels et au niveau des delta-cycles. Ce modèle permet de réduire la complexité de la modélisation des systèmes complexes due au problème de l'explosion combinatoire tout en restant fidèle au système initial. Ce modèle est compositionnel et supporte le rafinement. De plus, il est étendu par des paramètres temps ainsi que des compteurs afin de prendre en compte les aspects relatifs à la temporalité et aux propriétés fonctionnelles comme notamment la qualité de service. Nous proposons ensuite une chaîne de construction automatique des WSAs à partir de la description SystemC. Cette construction repose sur l'exécution symbolique et l'abstraction des prédicats. Nous proposons un ensemble d'algorithmes de composition et de réduction de ces automates afin de pouvoir étudier, analyser et vérifier les comportements concurrents des systèmes décrits ainsi que les échanges de données entre les différents composants. Nous proposons enfin d'appliquer notre approche dans le cadre de la modélisation et la simulation des systèmes complexes. Ensuite l'expérimenter pour donner une estimation du pire temps d'exécution (worst-case execution time (WCET)) en utilisant le modèle du Timed SystemC WSA. Enfin, on définit l'application des techniques du model checking pour prouver la correction de l'analyse abstraite de notre approche. / Embedded systems are increasingly integrated into existing real-time applications. They are usually composed of deeply integrated but heterogeneous hardware and software components. These components are developed under strict constraints. Accordingly, the work of design engineers became more tricky and challenging. To meet the high quality standards in nowadays embedded systems and to satisfy the rising industrial demands, the automatization of the developing process of those systems is gaining more and more importance. A major challenge is to develop an automated approach that can be used for the integrated verification and validation of complex and heterogeneous HW/SW systems.In this thesis, we propose a new compositional approach to model and verify hardware and software written in SystemC language. This approach is based on the SystemC Waiting State Automata (WSA). The SystemC Waiting State Automata are used to model the abstract behavior of hardware or software systems described in SystemC. They preserve the semantics of the SystemC scheduler at the temporal and the delta-cycle level. This model allows to reduce the complexity of the modeling process of complex systems due to the problem of state explosion during modeling while remaining faithful to the original system. The SystemC waiting state automaton is also compositional and supports refinement. In addition, this model is extended with parameters such as time and counters in order to take into account further aspects like temporality and other extra-functional properties such as QoS.In this thesis, we propose a stepwise approach on how to automatically extract the SystemC WSAs from SystemC descriptions. This construction is based on symbolic execution together with predicate abstraction. We propose a set of algorithms to symbolically compose and reduce the SystemC WSAs in order to study, analyze and verify concurrent behavior of systems as well as the data exchange between various components. We then propose to use the SystemC WSA to model and simulate hardware and software systems, and to compute the worst cas execution time (WCET) using the Timed SystemC WSA. Finally, we define how to apply model checking techniques to prove the correctness of the abstract analysis.

No description available.

The most challenging and spoken criminal phenomenon today is indisputably organised crime. It is a crime that both the general public, business community, commentators, researchers, scholars, journalists, writers, politicians, prosecutors, jurists and presiding officials debate with different interpretation and understanding of the concept as well as the manifestation of the phenomena. Debates on the subject have seen the dawn of rival terminologies of organised crime and crimes that are organised. While the United Nations has not assisted the nations in finding a definition of what organised crime is, the confusion has spread throughout the globe and South Africa has not been spared the pandemonium. The objective of this study is to comparatively assess the present understanding and setup in South Africa in comparison with Italy, Tanzania and the United States of America, identify the root causes of the confusion and find possible remedies to liberate the situation. The research concludes with the findings and recommendations. / Criminal & Procedural Law / LL.D.

Southern Sotho verbal relative clauses are, on discourse-pragmatic grounds, categorised as direct and indirect. The pragmatic factors that govern the occurrence of these two types of relatives within a particular discourse context are investigated. An analysis of relative clauses occurring in live conversations as well as in the dramas Bulane (Khaketla, 1983) and Tjootjo e tla hloma sese/a (Maake, 1992) reveals that direct relative clauses usually modify the reference of predicate nouns (i.e. nouns used as the complements of copulative predicates), while indirect relative clauses modify the reference of object nouns. Theories which suggest that both predicate as well as object nouns generally convey new information, but that the reference status of predicate nouns is non-specific indefinite, while that of object nouns is specific indefinite, are discussed. A hypothesis suggesting that there is an interrelationship between the reference status of a head noun and the type of relative by means of which it is qualified, is proposed. / African Languages / M.A. (African Languages)

Usability aspects of programming languages are often overlooked, yet have a substantial effect on programmer productivity. These issues are even more acute in the field of Inductive Synthesis, where programs are automatically generated from sample expected input and output data, and the programmer needs to be able to comprehend, and confirm or reject the suggested programs. A promising method of Inductive Synthesis, CombInduce, which is particularly suitable for synthesizing recursive programs, is a candidate for improvements in usability as the target language Combilog is not user-friendly. The method requires the target language to be strictly compositional, hence devoid of variables, yet have the expressiveness of definite clause programs. This sets up a challenging problem for establishing a user-friendly but equally expressive target language. Alternatives to Combilog, such as Quine's Predicate-functor Logic and Schönfinkel and Curry's Combinatory Logic also do not offer a practical notation: finding a more usable representation is imperative. This thesis presents two distinct approaches towards more convenient representations which still maintain compositionality. The first is Visual Combilog (VC), a system for visualizing Combilog programs. In this approach Combilog remains as the target language for synthesis, but programs can be read and modified by interacting with the equivalent diagrams instead. VC is implemented as a split-view editor that maintains the equivalent Combilog and VC representations on-the-fly, automatically transforming them as necessary. The second approach is Combilog with Name Projection (CNP), a textual iteration of Combilog that replaces numeric argument positions with argument names. The result is a language where argument names make the notation more readable, yet compositionality is preserved by avoiding variables. Compositionality is demonstrated by implementing CombInduce with CNP as the target language, revealing that programs with the same level of recursive complexity can be synthesized in CNP equally well, and establishing the underlying method of synthesis can also work with CNP. Our evaluations of the user-friendliness of both representations are supported by a range of methods from Information Visualization, Cognitive Modelling, and Human-Computer Interaction. The increased usability of both representations are confirmed by empirical user studies: an often neglected aspect of language design.

Τα τελευταία χρόνια οι εφαρμογές συνεχούς μετάδοσης ροών πληροφορίας στο διαδίκτυο έχουν γίνει ιδιαίτερα δημοφιλείς. Με τον συνεχώς αυξανόμενο ρυθμό εισόδου νέων αντικειμένων πληροφορίας, γίνεται ολοένα και πιο επιτακτική η ανάγκη για την ανάπτυξη πληροφορικών συστημάτων που να μπορούν να προσφέρουν στους χρήστες τους μόνο εκείνες τις πληροφορίες που τους ενδιαφέρουν, φιλτράροντας τεράστιους όγκους από άσχετες για τον κάθε χρήστη, πληροφορίες. Ένα μοντέλο διάδοσης πληροφορίας ικανό να ενσωματώσει τέτοιου είδους ιδιότητες, είναι το μοντέλο δημοσιεύσεων/συνδρομών βασισμένο στο περιεχόμενο ( content-based publish/subscribe) Βασική συνεισφορά μας στο χώρο είναι η εφαρμογή του μοντέλου δημοσιεύσεων/συνδρομών βασισμένου στο περιεχόμενο (content-based publish/subscribe) πάνω στα δίκτυα ομοτίμων ώστε να μπορέσουμε να προσφέρουμε στους χρήστες υψηλή εκφραστικότητα κατά την δήλωση των ενδιαφερόντων τους, λειτουργώντας σε ένα πλήρως κατανεμημένο και κλιμακώσιμο περιβάλλον. Ο κορμός των προτεινόμενων λύσεων σε αυτή τη διατριβή είναι: (α) η ανάπτυξη αλγορίθμων για την αποθήκευση των κλειδιών των δημοσιεύσεων σε κατάλληλους κόμβους του δικτύου με βάση τις συνθήκες στο περιεχόμενο που έχουν δηλωθεί και (β) αλγορίθμων δρομολόγησης δημοσιεύσεων στο διαδίκτυο έτσι ώστε να ((συναντούν)) αυτούς τους κόμβους οι οποίοι περιέχουν συνδρομές που ικανοποιούνται από την πληροφορία της δημοσίευσης. Οι προτεινόμενοι αλγόριθμοι υλοποιήθηκαν και εξετάσθηκαν ενδελεχώς με προσομοίωση μελετώντας την απόδοσή τους με βάση μετρικές όπως: η δίκαιη κατανομή του φόρτου στους κόμβους του δικτύου από τη διακίνηση μηνυμάτων κατά την επεξεργασία των συνδρομών/δημοσιεύσεων, ο συνολικός αριθμός μηνυμάτων που διακινούνται, ο συνολικός όγκος επιπλέον πληροφορίας που απαιτούν οι αλγόριθμοι να εισέλθει στο δίκτυο (network bandwidth), και ο χρόνος που απαιτείται για την ανεύρεση των συνδρομών που συζευγνύουν με κάθε δημοσίευση. / In the past few years the continuous data streams applications have become particularly popular. With the continuously increasing rate of entry of new information, it becomes imperative the need for developing appropriate infrastructures that will offer only the information that users are interested for, filtering out large volumes of irrelevant for each user, information. The content-based publish/subscribe model, is capable of handling large volumes of data traffic in a distributed, fully decentralized manner. Our basic contribution in this research area is the coupling of the content-based publish/subscribe model with the structured (DHT-based) peer-to-peer networks, offering high expressiveness to users on stating their interests. The proposed infrastructure operated in a distributed and scalable environment. The proposed solutions in this thesis are related to the development and testing: (a) of a number of algorithms for subscription processing in the network and (b) of a number of algorithms for processing the publication events. The proposed algorithms were developed and thoroughly tested with a detailed simulation-based experimentation. The performance metrics are: the fair distribution of load in the nodes of network from the distribution of messages while processing subscriptions and publication events, the total number of messages that are generated, the total volume of additional information that is required from the algorithms to operate, and the time that is required for matching publication events to subscriptions.

The original and still a major purpose of ontologies in computer and information sciences is to serve for the semantic integration of represented content, facilitating information system interoperability. Content can be data, information, and knowledge, and it can be distributed within or across these categories. A myriad of languages is available for representation. Ontologies themselves are artifacts which are expressed in various languages. Different such languages are utilized today, including, as well-known representatives, predicate logic, subsuming first-order (predicate) logic (FOL), in particular, and higher-order (predicate) logic (HOL); the Web Ontology Language (OWL) on the basis of description logics (DL); and the Unified Modeling Language (UML). We focus primarily on languages with formally defined syntax and semantics. This overall picture immediately suggests questions of the following kinds: What is the relationship between an ontology and the language in which it is formalized? Especially, what is the impact of the formal semantics of the language on the formalized ontology? How well understood is the role of ontologies in semantic integration? Can the same ontology be represented in multiple languages and/or in distinct ways within one language? Is there an adequate understanding of whether two expressions are intensionally/conceptually equivalent and whether two ontologies furnish the same ontological commitments? One may assume that these questions are resolved. Indeed, the development and adoption of ontologies is widespread today. Ontologies are authored in a broad range of different languages, including offering equally named ontologies in distinct languages. Much research is devoted to techniques and technologies that orbit ontologies, for example, ontology matching, modularization, learning, and evolution, to name a few. Ontologies have found numerous beneficial applications, and hundreds of ontologies have been created, considering solely the context of biomedical research. For us, these observations increase the relevance of the stated questions and close relatives thereof, and raise the desire for solid theoretical underpinnings. In the literature of computer and information sciences, we have found only few approaches that tackle the foundations of ontologies and their representation to allow for answering such questions or that actually answer them. We elaborate an analysis of the subject as the first item of central contributions within this thesis. It mainly results in the identification of a vicious circularity in (i) the intended use of ontologies to mediate between formal representations and (ii) solely exploiting formal semantic notions in representing ontologies and defining ontology-based equivalence as a form of intensional/conceptual equivalence. On this basis and in order to overcome its identified limitations, we contribute a general model-theoretic semantic account, named \\\"ontological semantics\\\". This kind of semantics takes the approach of assigning arbitrary entities as referents of atomic symbols and to link syntactic constructions with corresponding ontological claims and commitments. In particular, ontological semantics targets the avoidance of encoding effects in its definition. Therefore we argue that this semantic account is well suited for interpreting formalized ontologies and for defining languages for the representation of ontologies. It is further proposed as a fundament for envisioned novel definitions of the intensional equivalence of expressions, in potential deviation from only being formally equivalent under set-theoretic semantics. The thesis is defended that a particular usage of a formalism and its respective vocabulary should be accompanied by establishing an ontological semantics that is tailored to that use of the formalism, in parallel to the formal semantics of the language, in order to capture the ontological content of the formal representation for adequate reuse in other formalisms. Accordingly, we advocate ontological semantics as a useful framework for justifying translations on an intensional basis. Despite all deviations of ontological semantics from its set-theoretic blueprint, close relationships between the two can be shown, which allow for using established FOL and DL reasoners while assuming ontological semantics.

Southern Sotho verbal relative clauses are, on discourse-pragmatic grounds, categorised as direct and indirect. The pragmatic factors that govern the occurrence of these two types of relatives within a particular discourse context are investigated. An analysis of relative clauses occurring in live conversations as well as in the dramas Bulane (Khaketla, 1983) and Tjootjo e tla hloma sese/a (Maake, 1992) reveals that direct relative clauses usually modify the reference of predicate nouns (i.e. nouns used as the complements of copulative predicates), while indirect relative clauses modify the reference of object nouns. Theories which suggest that both predicate as well as object nouns generally convey new information, but that the reference status of predicate nouns is non-specific indefinite, while that of object nouns is specific indefinite, are discussed. A hypothesis suggesting that there is an interrelationship between the reference status of a head noun and the type of relative by means of which it is qualified, is proposed. / African Languages / M.A. (African Languages)

The original and still a major purpose of ontologies in computer and information sciences is to serve for the semantic integration of represented content, facilitating information system interoperability. Content can be data, information, and knowledge, and it can be distributed within or across these categories. A myriad of languages is available for representation. Ontologies themselves are artifacts which are expressed in various languages. Different such languages are utilized today, including, as well-known representatives, predicate logic, subsuming first-order (predicate) logic (FOL), in particular, and higher-order (predicate) logic (HOL); the Web Ontology Language (OWL) on the basis of description logics (DL); and the Unified Modeling Language (UML). We focus primarily on languages with formally defined syntax and semantics. This overall picture immediately suggests questions of the following kinds: What is the relationship between an ontology and the language in which it is formalized? Especially, what is the impact of the formal semantics of the language on the formalized ontology? How well understood is the role of ontologies in semantic integration? Can the same ontology be represented in multiple languages and/or in distinct ways within one language? Is there an adequate understanding of whether two expressions are intensionally/conceptually equivalent and whether two ontologies furnish the same ontological commitments? One may assume that these questions are resolved. Indeed, the development and adoption of ontologies is widespread today. Ontologies are authored in a broad range of different languages, including offering equally named ontologies in distinct languages. Much research is devoted to techniques and technologies that orbit ontologies, for example, ontology matching, modularization, learning, and evolution, to name a few. Ontologies have found numerous beneficial applications, and hundreds of ontologies have been created, considering solely the context of biomedical research. For us, these observations increase the relevance of the stated questions and close relatives thereof, and raise the desire for solid theoretical underpinnings. In the literature of computer and information sciences, we have found only few approaches that tackle the foundations of ontologies and their representation to allow for answering such questions or that actually answer them. We elaborate an analysis of the subject as the first item of central contributions within this thesis. It mainly results in the identification of a vicious circularity in (i) the intended use of ontologies to mediate between formal representations and (ii) solely exploiting formal semantic notions in representing ontologies and defining ontology-based equivalence as a form of intensional/conceptual equivalence. On this basis and in order to overcome its identified limitations, we contribute a general model-theoretic semantic account, named \\\"ontological semantics\\\". This kind of semantics takes the approach of assigning arbitrary entities as referents of atomic symbols and to link syntactic constructions with corresponding ontological claims and commitments. In particular, ontological semantics targets the avoidance of encoding effects in its definition. Therefore we argue that this semantic account is well suited for interpreting formalized ontologies and for defining languages for the representation of ontologies. It is further proposed as a fundament for envisioned novel definitions of the intensional equivalence of expressions, in potential deviation from only being formally equivalent under set-theoretic semantics. The thesis is defended that a particular usage of a formalism and its respective vocabulary should be accompanied by establishing an ontological semantics that is tailored to that use of the formalism, in parallel to the formal semantics of the language, in order to capture the ontological content of the formal representation for adequate reuse in other formalisms. Accordingly, we advocate ontological semantics as a useful framework for justifying translations on an intensional basis. Despite all deviations of ontological semantics from its set-theoretic blueprint, close relationships between the two can be shown, which allow for using established FOL and DL reasoners while assuming ontological semantics.:* Preface ** Abstract ** Contents ** Acknowledgments ** Foreword 1 Introduction 1.1 Background 1.2 Motivations 1.3 Theses, Objectives and Scope 1.4 Outline and Contributions 1.5 Formal Preliminaries 2 Foundations on Languages, Semantics, and Ontology 2.1 Formal Syntax and Formal Semantics 2.2 The Role of Ontologies in Semantic Integration 2.3 Ontological Analysis and Meta-Ontological Architecture 2.4 Conceptualization of Categories and Relations - CR 2.5 Summary of the Analysis and Next Steps 3 Views on Set-Theoretic Semantics of Classical Predicate Logics 3.1 Tarskian Model Theory and Set-Theoretic Superstructure 3.2 Formal Semantics and Choices for Entity Postulation 3.3 Theory View of Semantics 3.4 Aims for an Ontologically Neutral Semantic Account 4 Ontological Semantics 4.1 Definition of Ontological Structures by Analogy to the Set-Theoretic Approach 4.2 Properties and Further Background for Ontological Structures in General 4.3 Ontological Models & Signature Aspects 4.4 Semantics of Predication 4.5 Semantics of Connectives and Quantifiers & Semantic Notions 4.6 Relations between Ontological and Set-Theoretic Semantics 4.7 Ontological Neutrality 5 Ontological Engineering and Applications 5.1 Formalization Method for Ontology Representation in FOL 5.2 Ontological Usage Schemes 5.3 Glimpse on Characterizing Modular Representation 5.4 Applications in the Biomedical Domain 6 Contributions to Ontologies 6.1 Formalizations of Categories and Relations - CR 6.2 Remarks on Further Contributions 6.3 Ontologies of Time 7 Conclusion and Continuation 7.1 Resume 7.2 Related Work 7.3 Conclusions 7.4 Beginnings of Future Work Appendix A Additional Preliminaries A.1 Logical Notions A.2 Axiomatic Systems of Set and Number Theory B Axioms of the CR Taxonomy in OWL B.1 Asserted OWL Class Axioms B.2 Asserted OWL Object Property Axioms C Lists of Figures and Tables C.1 List of Figures C.2 List of Tables D Abbreviations, Acronyms and Names D.1 Abbreviations D.2 Acronyms and Names E References E.1 Literature References E.2 Web References/List of URLs F Work and Author Information ** Selbständigkeitserklärung (Declaration of Authorship) ** Bibliographic Data ** Scientific Record