A flexible framework for defeasible logics

Logics for knowledge representation suffer from over-specialization: while each logic may provide an ideal representation formalism for some problems, it is less than optimal for others. A solution to this problem is to choose from several logics and, when necessary, combine the representations. In general, such an approach results in a very difficult problem of combination. However, if we can choose the logics from a uniform framework then the problem of combining them is greatly simplified. In this paper, we develop such a framework for defeasible logics. It supports all defeasible logics that satisfy a strong negation principle. We use logic meta-programs as the basis for the framework.Comment: Proceedings of 8th International Workshop on Non-Monotonic Reasoning, April 9-11, 2000, Breckenridge, Colorad

Embedding Defeasible Logic into Logic Programming

Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of logic programs. In particular, we give a translation of a defeasible theory D into a meta-program P(D). We show that under a condition of decisiveness, the defeasible consequences of D correspond exactly to the sceptical conclusions of P(D) under the stable model semantics. Without decisiveness, the result holds only in one direction (all defeasible consequences of D are included in all stable models of P(D)). If we wish a complete embedding for the general case, we need to use the Kunen semantics of P(D), instead.Comment: To appear in Theory and Practice of Logic Programmin

Rule-Based Composite Event Queries

Reactive Web systems, Web services, and Web-based publish/ subscribe systems communicate events as XML messages, and in many cases require composite event detection: it is not sufficient to react to single event messages, but events have to be considered in relation to other events that are received over time. Emphasizing language design and formal semantics, we describe the rule-based query language XChangeEQ for detecting composite events. XChangeEQ is designed to completely cover and integrate the four complementary querying dimensions: event data, event composition, temporal relationships, and event accumulation. Semantics are provided as model and fixpoint theories; while this is an established approach for rule languages, it has not been applied for event queries before

Design and manufacturing optimization of epoxy-based adhesive specimens for multiaxial tests

Specimen design and manufacturing quality are decisive factors in the experimental determination of material properties, because they can only be reliably determined if all undesired influences have been minimized or are precisely known. The manufacture of specimens from highly viscous, two-component and fiber-reinforced structural adhesives presents a challenge from this point of view. Therefore, a design and manufacturing optimization procedure for fiber-reinforced structural adhesives and multiaxial testing was developed. It incorporated a finite element parametric study to minimize stress concentrations in the specimen geometry. Vacuum speed mixing was combined with 3D printed mold inserts to enable the manufacture of homogeneous specimens with negligible porosity. The method was demonstrated by means of a structural adhesive used to manufacture wind turbine rotor blades, while the manufacturing quality was verified with high-resolution X-ray microscopy (μCT scanning), enabling detailed detection of pores and geometrical imperfections. The results of uniaxial and biaxial static tests show maximized strength and stiffness properties, while the scatter was minimized in comparison to that stated in international literature. A comparison of the mechanical properties and associated manufacturing techniques is given. The comparison includes a porosity analysis of a specimen from an industrial dosing machine used for rotor blade manufacture. © 2021 The Author(s

Fatigue properties of a structural rotor blade adhesive under axial and torsional loading

Axial and torsional fatigue tests at different stress ratios were performed on a structural adhesive designed for wind turbine rotor blades. By employing previously optimized specimens, fatigue properties were recorded without influences of manufacturing-induced defects such as pores. The Stüssi S–N model was an excellent fit to the data and was combined with a Haibach extension line to account for uncertainties in the gigacycle fatigue regime. A comparison of the results with hand-mixed specimens revealed significant and load level-dependent differences, indicating that manufacturing safety factors should be applied to the slope of the S–N curve. The experiments were accompanied by stiffness degradation measurements, which enabled an analysis of Young's and shear modulus degradation interactions. The degradation was modeled using power law fits, which incorporated load level-dependent fitting parameters to allow for a full description of the stiffness reduction and a prediction of the residual fatigue life of run-out specimens

Argumentation Semantics for Defeasible Logics

Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of business rules. So far defeasible logic has been defined only proof-theoretically. Argumentation-based semantics have become popular in the area of logic programming. In this paper we give an argumentation-based semantics for defeasible logic. Recently it has been shown that a family of approaches can be built around defeasible logic, in which different intuitions can be followed. In this paper we present an argumentation-based semantics for an ambiguity propagating logic, too. Further defeasible logics can be characterised in a similar way

Argumentation Semantics for Defeasible Logics

Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modeling of business rules. This paper establishes significant links between defeasible reasoning and argumentation. In particular, Dung-like argumentation semantics is provided for two key defeasible logics, of which one is ambiguity propagating and the other ambiguity blocking. There are several reasons for the significance of this work: (a) establishing links between formal systems leads to a better understanding and cross-fertilization, in particular our work sheds light on the argumentation-theoretic features of defeasible logic; (b) we provide the first ambiguity blocking Dung-like argumentation system; (c) defeasible reasoning may provide an efficient implementation platform for systems of argumentation; and (d) argumentation-based semantics support a deeper understanding of defeasible reasoning, especially in the context of the intended applications

A comparison of sceptical NAF-free logic programming approaches

Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. Historically the first logic in this class was Defeasible Logic. In this paper we will study its relationship to other approaches which also rely on the idea of using logic rules and priorities. In particular we will study sceptical LPwNF, courteous logic programs, and priority logic

On the Modeling and Analysis of Regulations

Regulations are a wide-spread and important part of government and business. They codify how products must be made and processes should be performed. Such regulations can be difficult to understand and apply. In an environment of growing complexity of, and change in, regulation, automated support for reasoning with regulations is becoming increasingly necessary. In this paper we report on ongoing work which aims at providing automated support for the drafting and use of regulations using logic modelling techniques. We highlight the support that can be provided by logic modelling, describe the technical foundation of our project, and report on the status of the project and the next steps