The reliability analysis method and the allowable stress method were both applied in this study to determine design values of ultimate compression strength (UCS) of visually-graded 40 x 65 mm dimension Chinese larch lumber. A total of 784 lumber samples were tested on the static full-size compression strength, according to Chinese National Standards. The goodness-of-fit for the UCS distribution...

The paper starts with an examination and critique of Tarski’s wellknown proposed explication of the notion of logical operation in the type structure over a given domain of individuals as one which is invariant with respect to arbitrary permutations of the domain. The class of such operations has been characterized by McGee as exactly those definable in the language L∞,∞. Also characterized sim...

We propose a simple but powerful approach to the verification of parameterised systems. The approach is based on modelling the reachability between parameterized states as deducibility between suitable encodings of states by formulae of first-order predicate logic. To establish a safety property, that is non-reachability of unsafe states, the finite model finder is used to find a finite counter...

The efficiency and robustness of reliability methods are two important factors in the first-order reliability method (FORM). The conjugate choice control (CCC) and directional chaos control method (DCC) are developed to improve the robustness and efficiency of the FORM formula using the stability transformation method. In this paper, the CCC and DCC methods are applied for the reliability analy...

In this paper, a more efficient approach for component-level structural reliability analysis using the First Order Reliability Method (FORM) is presented. In this approach, the continuum design sensitivity analysis (DSA) and a two-point approximation (TPA) method are employed to support the most probable point (MPP) search in the random variable space for structural reliability analysis. This a...

Generalization operators have long been studied in the area of Conceptual Inductive Learning (Michalski, 1983; De Raedt, 2010). We present an implementation of these learning operators in a prototype system for cooperative query answering. The implementation can however also be used as a usual concept learning mechanism for concepts described in first-order predicate logic. We sketch an extensi...

We consider the problem of simultaneously compressing a finite set of words by a single grammar. The central result of this paper is the construction of an incompressible sequence of finite word languages. This result is then shown to transfer to tree languages and (via a previously established connection between proof theory and formal language theory) also to formal proofs in first-order pred...

We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents ⊥. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we...

An abstraction mapping over clausal form theories in first-order predicate calculus is presented that involves the renaming of predicate symbols. This renaming is not 1-1, in the sense that several predicate symbols Ri,.. . , Rn from the original theory are all replaced by a single symbol R in the abstract theory. In order to preserve consistency, however, the clauses that distinguish the Rj's ...