Search

Start Over Subject application

1. A consensus based algorithm for grounding belief formulas in internally stored perceptions

Creator:
Katarzyniak, Radosław and Pieczyńska - Kuchtiak, Agnieszka
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
symbol grounding, belief formulas, cognitive agent, consensus theory, and application
Language:
English
Description:
In this paper an original algorithm for tlie choice of a relevaiit belief formula is presented. Belief forinulas are treated as external representations of internal States of cognition directed at an ontologically existing atom object. This algorithrn is based on the idea of intentional semantics and uses soft methods based on the theory of consensus and choice.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

2. Annotate

Creator:
Roček, Martin
Publisher:
Charles University, Faculty of Arts
Type:
TEXT and toolService
Subject:
manuscripts, annotation, application, TEI, and JavaScript
Language:
No linguistic content
Description:
Annotate is a web and desktop application that should simplify the process of transforming photos of manuscripts to a browsable collection. It also allows users to annotate parts of the displayed images.
Rights:
GNU Library or "Lesser" General Public License 3.0 (LGPL-3.0), http://opensource.org/licenses/LGPL-3.0, and PUB

3. Some issues of fuzzy querying in relational databases

Creator:
Hudec, Miroslav and Vučetić, Milian
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
membership functions, aggregation functions, preferences, commutative queries, non-commutative queries, empty and overabundant answers, and application
Language:
English
Description:
Fuzzy logic has been used for flexible database querying for more than 30 years. This paper examines some of the issues of flexible querying which seem to have potential for further research and development from theoretical and practical points of view. More precisely, defining appropriate fuzzy sets for queries, calculating matching degrees for commutative and non-commutative query conditions, preferences, merging constraints and wishes, empty and overabundant answers, and views on practical realizations are discussed in this paper. Suggestions how to solve them and integrate into one compact solution are also outlined in this paper.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public