454 search results - page 8 / 91 » Representation results for defeasible logic |
SEBD
2003
13 years 10 months ago
2003
Nowadays, the vast volume of collected digital data obliges us to employ processing methods like pattern recognition and data mining in order to reduce the complexity of data manag...
ARGMAS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...
ISMVL
2002
IEEE
14 years 1 months ago
2002
IEEE
This paper considers quasi-reduced multi-valued decision diagrams with bits (QRMDD( )s) to represent twovalued logic functions. It shows relations between the numbers of nodes in ...
DATE
1998
IEEE
14 years 25 days ago
1998
IEEE
Simple disjunctive decomposition is a special case of logic function decompositions, where variables are divided into two disjoint sets and there is only one newly introduced vari...
SEMWEB
2007
Springer
14 years 2 months ago
2007
Springer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. Fuzzy Description Logics were born to represent the former type of knowledge, but ...