Page 1 Next

Displaying 1 – 20 of 46

Showing per page

A genetic algorithm for the multistage control of a fuzzy system in a fuzzy environment.

Janusz Kacprzyk (1997)

Mathware and Soft Computing

We discuss a prescriptive approach to multistage optimal fuzzy control of a fuzzy system, given by a fuzzy state transition equation. Fuzzy constraints and fuzzy goals at consecutive control stages are given, and their confluence, Bellman and Zadeh's fuzzy decision, is an explicit performance function to be optimized. First, we briefly survey previous basic solution methods of dynamic programming (Baldwin and Pilsworth, 1982) and branch-and-bound (Kacprzyk, 1979), which are plagued by low numerical...

A theory of refinement structure of hedge algebras and its applications to fuzzy logic

Nguyen Ho, Huynh Nam (1999)

Banach Center Publications

In [13], an algebraic approach to the natural structure of domains of linguistic variables was introduced. In this approach, every linguistic domain can be interpreted as an algebraic structure called a hedge algebra. In this paper, a refinement structure of hedge algebras based on free distributive lattices generated by linguistic hedge operations will be examined in order to model structure of linguistic domains more properly. In solving this question, we restrict our consideration to the specific...

Aggregation, Non-Contradiction and Excluded-Middle.

Ana Pradera, Enric Trillas (2006)

Mathware and Soft Computing

This paper investigates the satisfaction of the Non-Contradiction (NC) and Excluded-Middle (EM) laws within the domain of aggregation operators. It provides characterizations both for those aggregation operators that satisfy NC/EM with respect to (w.r.t.) some given strong negation, as well as for those satisfying them w.r.t. any strong negation. The results obtained are applied to some of the most important known classes of aggregation operators.

An axiom system for incidence spatial geometry.

Rafael María Rubio, Alfonso Ríder (2008)


Incidence spatial geometry is based on three-sorted structures consisting of points, lines and planes together with three intersort binary relations between points and lines, lines and planes and points and planes. We introduce an equivalent one-sorted geometrical structure, called incidence spatial frame, which is suitable for modal considerations. We are going to prove completeness by SD-Theorem. Extensions to projective, affine and hyperbolic geometries are also considered.

An orthogonality-based classification of conjectures in ortholattices.

Enric Trillas, Ana Pradera (2006)

Mathware and Soft Computing

A mathematical model for conjectures (including hypotheses, consequences and speculations), was recently introduced, in the context of ortholattices, by Trillas, Cubillo and Castiñeira (Artificial Intelligence 117, 2000, 255-257). The aim of the present paper is to further clarify the structure of this model by studying its relationships with one of the most important ortholattices' relation, the orthogonality relation. The particular case of orthomodular lattices -the framework for both Boolean...

Application of deontic logic in Role-Based Access Control

Grzegorz Kołaczek (2002)

International Journal of Applied Mathematics and Computer Science

The paper presents a short overview of the foundations of the Role-Based Access Control Modal Model and its properties. In particular, the translation of these model formulae to the first-order logic formulae in a form of Horn's clauses is analysed. The automation of processes and mechanisms related to access control on the basis of logical automated reasoning and the PROLOG language are described.

Applying fuzzy logic in video surveillance systems.

José Manuel Molina, Jesús García, Oscar Pérez, Javier Carbó, Antonio Berlanga, José Ignacio Portillo (2005)

Mathware and Soft Computing

In this work, the application of fuzzy logic in surveillance systems based on cameras is analyzed. Three different fuzzy systems have been tested and compared with a crisp decision system. The first one has been developed using an expert knowledge, the second one was learned from recorded videos, and a third one is developed as a refinement taking into account evaluation with ground truth. In all cases, the core of the system is the association function, in which the developed fuzzy system takes...

Default logic as a formalism for understanding commonsense reasoning.

Gianni Amati, Luigia Carlucci Aiello, Fiora Pirri (1996)

Mathware and Soft Computing

Commonsense reasoning is the reasoning of agents interacting with the real world. Non monotonic reasoning is a well developed research area gathering the logical formalisms that treat commonsense reasoning. One of the best known of such formalisms is Default logic. In this paper we discuss Default logic at both the proof-theoretic and semantics levels and show that Default logic provides a clear and formal framework to understand the logical nature of commonsense reasoning.

Experimental analysis of some computation rules in a simple parallel reasoning system for the ALC description logic

Adam Meissner (2011)

International Journal of Applied Mathematics and Computer Science

A computation rule determines the order of selecting premises during an inference process. In this paper we empirically analyse three particular computation rules in a tableau-based, parallel reasoning system for the ALC description logic, which is built in the relational programming model in the Oz language. The system is constructed in the lean deduction style, namely, it has the form of a small program containing only basic mechanisms, which assure soundness and completeness of reasoning. In...

Currently displaying 1 – 20 of 46

Page 1 Next