All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5

Displaying 81 – 92 of 92

Showing per page

The embedding of the formal concept analysis into the L-Fuzzy concept theory.

Ana Burusco Juandeaburre, Ramón Fuentes-González (1998)

Mathware and Soft Computing

In this work, we study the relation between the concept lattice of Wille ([5], [6]) and the L-Fuzzy concept lattice ([2]) developed by us. To do it, we have defined an application g that associates to each concept of Wille an L-Fuzzy concept. The main point of this work is to prove that if we are working with a crisp relation between an object set and an attribute set, the concept lattice of Wille is a sublattice of the L-Fuzzy concept lattice. At the end, we show a typical example in the formal...

The Gödel Completeness Theorem for Uncountable Languages

Julian J. Schlöder, Peter Koepke (2012)

Formalized Mathematics

This article is the second in a series of two Mizar articles constituting a formal proof of the Gödel Completeness theorem [15] for uncountably large languages. We follow the proof given in [16]. The present article contains the techniques required to expand a theory such that the expanded theory contains witnesses and is negation faithful. Then the completeness theorem follows immediately.

The Value of Knowing that You Do Not Know

Greenstein, Gil, Ahituv, Niv (2009)

Serdica Journal of Computing

The value of knowing about data availability and system accessibility is analyzed through theoretical models of Information Economics. When a user places an inquiry for information, it is important for the user to learn whether the system is not accessible or the data is not available, rather than not have any response. In reality, various outcomes can be provided by the system: nothing will be displayed to the user (e.g., a traffic light that does not operate, a browser that keeps browsing, a telephone...

Totally coherent set-valued probability assessments

Angelo Gilio, Salvatore Ingrassia (1998)

Kybernetika

We introduce the concept of total coherence of a set-valued probability assessment on a family of conditional events. In particular we give sufficient and necessary conditions of total coherence in the case of interval-valued probability assessments. Some relevant cases in which the set-valued probability assessment is represented by the unitary hypercube are also considered.

Towards an extension of the 2-tuple linguistic model to deal with unbalanced linguistic term sets

Mohammed-Amine Abchir, Isis Truck (2013)

Kybernetika

In the domain of Computing with words (CW), fuzzy linguistic approaches are known to be relevant in many decision-making problems. Indeed, they allow us to model the human reasoning in replacing words, assessments, preferences, choices, wishes... by ad hoc variables, such as fuzzy sets or more sophisticated variables. This paper focuses on a particular model: Herrera and Martínez' 2-tuple linguistic model and their approach to deal with unbalanced linguistic term sets. It is interesting since the...

Transition of Consistency and Satisfiability under Language Extensions

Julian J. Schlöder, Peter Koepke (2012)

Formalized Mathematics

This article is the first in a series of two Mizar articles constituting a formal proof of the Gödel Completeness theorem [17] for uncountably large languages. We follow the proof given in [18]. The present article contains the techniques required to expand formal languages. We prove that consistent or satisfiable theories retain these properties under changes to the language they are formulated in.

Two operations of merging and splitting components in a chain graph

Milan Studený, Alberto Roverato, Šárka Štěpánová (2009)

Kybernetika

In this paper we study two operations of merging components in a chain graph, which appear to be elementary operations yielding an equivalent graph in the respective sense. At first, we recall basic results on the operation of feasible merging components, which is related to classic LWF (Lauritzen, Wermuth and Frydenberg) Markov equivalence of chain graphs. These results are used to get a graphical characterisation of factorisation equivalence of classic chain graphs. As another example of the use...

Variations on undirected graphical models and their relationships

David Heckerman, Christopher Meek, Thomas Richardson (2014)

Kybernetika

We compare alternative definitions of undirected graphical models for discrete, finite variables. Lauritzen [7] provides several definitions of such models and describes their relationships. He shows that the definitions agree only when joint distributions represented by the models are limited to strictly positive distributions. Heckerman et al. [6], in their paper on dependency networks, describe another definition of undirected graphical models for strictly positive distributions. They show that...

Verification of the Formal Concept Analysis.

José Antonio Alonso, Joaquín Borrego, María José Hidalgo, Francisco Jesús Martín Mateos, José Luis Ruiz Reina (2004)

RACSAM

This paper is concerned with a formal verification of the Formal Concept Analysis framework. We use the PVS system to represent and formally verify some algorithms of this theory. We also develop a method to transform specifications of algorithms based on finite sets into other executable ones, preserving its correctness. We illustrate this method by constructing an executable algorithm to compute an implicational base of the system of implications between attributes of a finite formal context.

Z specification of object oriented constraint programs.

Laurent Henocque (2004)

RACSAM

Object oriented constraint programs (OOCPs) emerge as a leading evolution of constraint programming and artificial intelligence, first applied to a range of industrial applications called configuration problems. The rich variety of technical approaches to solving configuration problems (CLP(FD), CC(FD), DCSP, Terminological systems, constraint programs with set variables, . . . ) is a source of difficulty. No universally accepted formal language exists for communicating about OOCPs, which makes...

Currently displaying 81 – 92 of 92

Previous Page 5