Feasible uncertain reasoning for multi agent ontology mapping

MCCSIS'08 - IADIS Multi Conference on Computer Science and Information Systems; Proceedings of Informatics 2008 and Data Mining 2008

Volumn , Issue , 2008, Pages 19-26

  Nagy, Miklos ^a   Vargas Vera, Maria ^a   Motta, Enrico ^a  

^a OPEN UNIVERSITY   (United Kingdom)

Author keywords

Genetic algorithm; Multi agent systems; Semantic web; Uncertain reasoning

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTERS; FORMAL LOGIC; GENETIC ALGORITHMS; INFORMATION MANAGEMENT; INFORMATION SYSTEMS; INFORMATION THEORY; ONTOLOGY; PROGRAMMING THEORY; SEMANTIC WEB; SEMANTICS; TREES (MATHEMATICS);

AGENT SYSTEMS; ALGORITHM SOLUTION; BACKGROUND KNOWLEDGE (BK); DEMPSTER-SHAFER THEORY (DST); GENETIC ALGORITHM; ONTOLOGY MAPPINGS; PROBLEM SPACE; REASONING PROCESSES; SEMANTIC WEB APPLICATIONS; UNCERTAIN REASONING;

MULTI AGENT SYSTEMS;

EID: 58449116093     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Arnborg, S., et al.,1987. Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, 8(2), 277-284.
2. Bauer, M., 1996. Approximations for decision making in the Dempster- Shafer theory of evidence, In Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence, pp. 73-80,
3. st International Joint Conference on Qualitative and Quantitative Practical Reasoning (ECSQARU-FAPR'97), volume 1244 of Lecture Notes in Computer Science, pp. 198-209. Springer,
4. Gomez, M., Bielza, C., 2004, Node deletion sequences in influence diagrams using genetic algorithms, Statistics and Computing, 14(3), 181-198, (2004).
5. Harmanec, D.,1999, Faithful approximations of belief function, In Proceedings of the 15th Annual Conference on Uncertainty in Artificial Intelligence (UAI-99), pp. 271-27, San Francisco, CA, Morgan Kaufmann.
6. Kjaerulff, U., 1992. Optimal decomposition of probabilistic networks by simulated annealing, Statistics and Computing, 2, 7-17.
7. Larranaga, P., et al., 1997. Decomposing bayesian networks: triangulation of the moral graph with genetic algorithms, Statistics and Computing, 7(1), 19-34.
8. Nagy, M., et al., 2006. Dssim-ontology mapping with uncertainty, In Proceedings of the 1st International Workshop on Ontology Matching (OM-2006), volume 225.
9. Nagy, M., et al., 2006. Uncertainty handling in the context of ontology mapping for question answering, In Proceedings of AAAI-2006 Symposium on Semantic Web for Collaborative Knowledge Acquisition.
10. Orponen, P., 1990. Dempsters rule of combination is #p-complete, Artificial Intelligence, volume 44, pp. 245-253.
11. Rose, D., 1972. A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, Graph Theory and Computing, pp. 183-217. Academic Press, New York.
12. Rose, D., Tarjan, E., 1975. Algorithmic aspects of vertex elimination, In STOC '75: Proceedings of seventh annual ACM symposium on Theory of computing, pp. 245-254. ACM.
13. Sabou, M., et al., 2006. Using the semantic web as background knowledge for ontology mapping, In Proceedings of the 1st International Workshop on Ontology Matching (OM-2006), volume 225.
14. Shenoy, P., 1989. A valuation-based language for expert systems, International Journal for Approximate Reasoning, volume 3, pp. 383-411.
15. Shenoy, P., Shafer, G., 1988. Axioms for probability and belief function propagation', In Proceedings of the 4th Annual Conference on Uncertainty in Artificial Intelligence (UAI-88), pp. 169-198, New York, NY, Elsevier Science.
16. Wang, H., et al., 2006. Triangulation of Bayesian networks using an adaptive genetic algorithm, Foundations of Intelligent Systems, 4203, 127-136.