COMPUTING PERFECT AND STABLE MODELS USING ORDERED MODEL TREES

Ordered model trees were introduced as a normal form for disjunctive deductive databases. They were also used to facilitate the computation of minimal models for disjunctive theories by exploiting the order imposed on the Herbrand base of the theory. In this work we show how the order on the Herbrand base can be used to compute perfect models of a disjunctive stratified finite theory. We are able to compute the stable models of a general finite theory by combining the order on the elements of the Herbrand base with previous results that had shown that the stable models of a theory T can be computed as the perfect models of a corresponding disjunctive theory ɛ T resulting from applying the so called evidential transformation to T. While other methods consider many models that are rejected at the end, the use of atom ordering allows us to guarantee that every model generated belongs to the class of models being computed. As for negation-free databases, the ordered tree serves as the canonical representation of the database.     

A Fixpoint Semantics for Stratified Databases

Przmusinski extended the notion of stratified logic programs,developed by Apt,Blair and Walker,and by van Gelder,to stratified databases that allow both negative premises and disjunctive consequents.However,he did not provide a fixpoint theory for such class of databases.On the other hand,although a fixpoint semantics has been developed by Minker and Rajasekar for non-Horn logic programs,it is tantamount to traditional minimal model semantics which is not sufficient to capture the intended meaning of negation in the premises of clauses in stratified databases.In this paper,a fixpoint approach to stratified databases is developed,which corresponds with the perfect model semantics.Moreover,algorithms are proposed for computing the set of perfect models of a stratified database.     

Causal fault detection and isolation based on a set-membership approach

This paper presents a diagnostic methodology relying on a set-membership approach for fault detection and on a causal model for fault isolation. Set-membership methods are a promising approach to fault detection because they take into account a priori knowledge of model uncertainties and measurement errors. Every uncertain model parameter and/or measurement is represented by a bounded variable. In this paper, detection consists of verifying the membership of measurements to an interval. First order discrete time models are used and their output is explicitly computed with interval arithmetic. Fault isolation relies on a causal analysis and the exoneration principle, which allows focusing the consistency tests on simple local models. The isolation strategy consists of two steps: performing minimal tests found with the causal graph and determining on line additional relevant tests that reduce the final diagnosis. An application for a nuclear process is used in order to illustrate the method's efficiency.     

On the Computation of the Disjunctive Well-Founded Semantics

A characterization of the disjunctive well-founded semantics (DWFS) is given in terms of the Gelfond–Lifschitz transformation. This characterization is used to develop a top-down method of testing DWFS membership, employing a hyperresolution-like operator and quasi-cyclic trees to handle minimal model processing. A flexible bottom-up method of computing the DWFS is also given that admits the use of a powerful reduction operator. For finite propositional databases, all of our methods run in polynomial space.     

Linear Fuzzy Clustering With Selection of Variables Using Graded Possibilistic Approach

Linear fuzzy clustering is a useful tool for knowledge discovery in databases (KDD), and several modifications have been proposed in order to analyze real world data. This paper proposes a new approach for estimating local linear models, in which linear fuzzy clustering is performed by selecting variables that are useful for extracting correlation structure in each cluster. The new clustering model uses two types of memberships. One is the conventional membership that represents the degree of membership of each sample in each cluster. The other is the additional parameter that represents the relative responsibility of each variable for estimation of local linear models. The additional membership takes large values when the variable has close relationship with local principal components, and is calculated by using the graded possibilistic approach. Numerical experiments demonstrate that the proposed method is useful for identifying local linear model taking typicality of each variable into account.     

Multi-aspect target discrimination using hidden Markov models and neural networks

This paper presents a new multi-aspect pattern classification method using hidden Markov models (HMMs). Models are defined for each class, with the probability found by each model determining class membership. Each HMM model is enhanced by the use of a multilayer perception (MLP) network to generate emission probabilities. This hybrid system uses the MLP to find the probability of a state for an unknown pattern and the HMM to model the process underlying the state transitions. A new batch gradient descent-based method is introduced for optimal estimation of the transition and emission probabilities. A prediction method in conjunction with HMM model is also presented that attempts to improve the computation of transition probabilities by using the previous states to predict the next state. This method exploits the correlation information between consecutive aspects. These algorithms are then implemented and benchmarked on a multi-aspect underwater target classification problem using a realistic sonar data set collected in different bottom conditions.     

Cap models for clay strata to footing loads

Plasticity cap models are applied to obtain progressive failure solutions of flexible and smooth strip footings as well as rigid and rough strip footings on an overconsolidated stratum of clay. The comparative study of the elastic-plastic small deformation response of clay to footing loads is made within the framework of finite element analysis with different plasticity models based on a non-associated and the associated flow rule. More specifically, the analyses include the following features: (i) Drucker-Prager perfect plastic model with different methods in determining the material constants using the associated flow rule, (ii) Drucker-Prager perfect plastic model with the associated flow rule and a non-associated flow rule, and (iii) Drucker-Prager perfect plastic yield surface with a work-hardening plane cap and a work-hardening elliptic cap and their associated flow rules.     

Minimal model generation for refined answering of generalized queries in disjunctive deductive databases

Generalized queries are defined as sets of clauses in implication form. They cover several tasks of practical importance for database maintenance such as answering positive queries, computing database completions and integrity constraints checking. We address the issue of answering generalized queries under the minimal model semantics for the class of disjunctive deductive databases (DDDBs). The advanced approach is based on having the query induce an order on the models returned by a sound and complete minimal model generating procedure. We consider answers that are true in all and those that are true in some minimal models of the theory. We address the issue of answering positive queries through the construction of the minimal model state of the DDDB, using a minimal model generating procedure. The refinements allowed by the procedure include isolating a minimal component of a disjunctive answer, the specification of possible updates to the theory to enable the derivability of certain queries and deciding the monotonicity properties of answers to different classes of queries.     

Optimal Design of Object-Oriented Databases in Automatic Information-Control Systems. II. Models and Methods of Design of Optimal Logical Structures for Object-Oriented Databases

Part II is devoted to the formulation of the problem and models and methods of design of optimal logical structures for object-oriented databases used in designing automatic information control systems. The effectiveness criteria used for the problem design are defined by the minimal total time of utilization of databases and service of a given set of user inquires and transactions, minimal total time of implementation of a set of inquires and transactions over the database. Design problems are formulated as nonlinear integer programming problems and effective exact and heuristic algorithms are developed to solve them.     

Hybrid identification of fuzzy rule‐based models

In this study, we propose a hybrid identification algorithm for a class of fuzzy rule‐based systems. The rule‐based fuzzy modeling concerns structure optimization and parameter identification using the fuzzy inference methods and hybrid structure combined with two methods of optimization theories for nonlinear systems. Two types of inference methods of a fuzzy model concern a simplified and linear type of inference. The proposed hybrid optimal identification algorithm is carried out using a combination of genetic algorithms and an improved complex method. The genetic algorithms determine initial parameters of the membership function of the premise part of the fuzzy rules. In the sequel, the improved complex method (being in essence a powerful auto‐tuning algorithm) leads to fine‐tuning of the parameters of the respective membership functions. An aggregate performance index with a weighting factor is proposed in order to achieve a balance between performance of the fuzzy model obtained for the training and testing data. Numerical examples are included to evaluate the performance of the proposed model. They are also contrasted with the performance of the fuzzy models existing in the literature. © 2002 John Wiley & Sons, Inc.