Idioma:

Boolean Judgment Logic

Wille, Rudolf

Conceptual Structures: Broadening the Base, 2001, p.115-128 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Boolean Judgment Logic
Autor: Wille, Rudolf
Assuntos: Applied sciences ; Artificial intelligence ; Basic Algebra ; Computer science; control theory; systems ; Concept Lattice ; Conceptual Structure ; Connectionism. Neural networks ; Exact sciences and technology ; Formal Concept ; Formal Context ; Learning and adaptive systems
É parte de: Conceptual Structures: Broadening the Base, 2001, p.115-128
Descrição: How to introduce negations for formal (semi-)concepts of formal contexts was shown in “Boolean Concept Logic” [Wi00a]. For formal judgments, which are represented by concept graphs of power context families, there is the problem that the negation of a judgment is no more a judgment since judgments are understood as valid propositions. This problem is solved in “Boolean Judgment Logic” by introducing the “negating inversion” This leads to basic algebras of (semi-)concept graphs of power context families which are investigated in this paper to obtain a mathematical foundation of Boolean Judgment Logic. The basic notions and relationships are illustrated by an example concerned with an information system for supporting the configuration of PCs.
Editor: Berlin, Heidelberg: Springer Berlin Heidelberg
Idioma: Inglês

Links

Voltar para lista de resultados