363,074 research outputs found

    Modeling as Scientific Reasoningā€”The Role of Abductive Reasoning for Modeling Competence

    Get PDF
    While the hypothetico-deductive approach, which includes inductive and deductive reasoning, is largely recognized in scientific reasoning, there is not much focus on abductive reasoning. Abductive reasoning describes the theory-based attempt of explaining a phenomenon by a cause. By integrating abductive reasoning into a framework for modeling competence, we strengthen the idea of modeling being a key practice of science. The framework for modeling competence theoretically describes competence levels structuring the modeling process into model construction and model application. The aim of this theoretical paper is to extend the framework for modeling competence by including abductive reasoning, with impact on the whole modeling process. Abductive reasoning can be understood as knowledge expanding in the process of model construction. In combination with deductive reasoning in model application, such inferences might enrich modeling processes. Abductive reasoning to explain a phenomenon from the best fitting guess is important for model construction and may foster the deduction of hypotheses from the model and further testing them empirically. Recent studies and examples of learnersā€™ performance in modeling processes support abductive reasoning being a part of modeling competence within scientific reasoning. The extended framework can be used for teaching and learning to foster scientific reasoning competences within modeling processes.Peer Reviewe

    Temporal Data Modeling and Reasoning for Information Systems

    Get PDF
    Temporal knowledge representation and reasoning is a major research field in Artificial Intelligence, in Database Systems, and in Web and Semantic Web research. The ability to model and process time and calendar data is essential for many applications like appointment scheduling, planning, Web services, temporal and active database systems, adaptive Web applications, and mobile computing applications. This article aims at three complementary goals. First, to provide with a general background in temporal data modeling and reasoning approaches. Second, to serve as an orientation guide for further specific reading. Third, to point to new application fields and research perspectives on temporal knowledge representation and reasoning in the Web and Semantic Web

    Abductive and Consistency-Based Diagnosis Revisited: a Modeling Perspective

    Full text link
    Diagnostic reasoning has been characterized logically as consistency-based reasoning or abductive reasoning. Previous analyses in the literature have shown, on the one hand, that choosing the (in general more restrictive) abductive definition may be appropriate or not, depending on the content of the knowledge base [Console&Torasso91], and, on the other hand, that, depending on the choice of the definition the same knowledge should be expressed in different form [Poole94]. Since in Model-Based Diagnosis a major problem is finding the right way of abstracting the behavior of the system to be modeled, this paper discusses the relation between modeling, and in particular abstraction in the model, and the notion of diagnosis.Comment: 5 pages, 8th Int. Workshop on Nonmonotonic Reasoning, 200

    Disjunctive Logic Programs with Inheritance

    Full text link
    The paper proposes a new knowledge representation language, called DLP<, which extends disjunctive logic programming (with strong negation) by inheritance. The addition of inheritance enhances the knowledge modeling features of the language providing a natural representation of default reasoning with exceptions. A declarative model-theoretic semantics of DLP< is provided, which is shown to generalize the Answer Set Semantics of disjunctive logic programs. The knowledge modeling features of the language are illustrated by encoding classical nonmonotonic problems in DLP<. The complexity of DLP< is analyzed, proving that inheritance does not cause any computational overhead, as reasoning in DLP< has exactly the same complexity as reasoning in disjunctive logic programming. This is confirmed by the existence of an efficient translation from DLP< to plain disjunctive logic programming. Using this translation, an advanced KR system supporting the DLP< language has been implemented on top of the DLV system and has subsequently been integrated into DLV.Comment: 28 pages; will be published in Theory and Practice of Logic Programmin
    • ā€¦
    corecore