ECSQARU 2005: Symbolic and Quantitative Approaches to Reasoning with Uncertainty pp 477-488 | Cite as
A Local Fusion Method of Temporal Information
Abstract
Information often comes from different sources and merging these sources usually leads to apparition of inconsistencies. Fusion is the operation which consists in restoring the consistency of the merged information by changing a minimum of the initial information. There are many fields or applications where the information can be represented by simple linear constraints. For instance in scheduling problems, some geographic information can be also expressed by linear constraints. In this paper, we are interested in linear constraints fusion in the framework of simple temporal problems (STPs). We propose a fusion method and we experiment with it on random temporal problem instances.
Keywords
Short Path Temporal Information Linear Constraint Fusion Method Distance GraphPreview
Unable to display preview. Download preview PDF.
References
- 1.Benferhat, S., Dubois, D., Prade, H.: Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study part 1: The flat case. Studia Logica 58, 17–45 (1997)MATHCrossRefMathSciNetGoogle Scholar
- 2.Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)MATHGoogle Scholar
- 3.Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)MATHCrossRefMathSciNetGoogle Scholar
- 4.Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and co, New York (1979)MATHGoogle Scholar
- 5.Khelfallah, M., Benhamou, B.: Geographic information revison based on constraints. In: Proc. of the 14th Eur. Conf. on Artificial Intelligence, ECAI 2004, pp. 828–832 (2004)Google Scholar
- 6.Khelfallah, M., Benhamou, B.: Two revision methods based on constraints: Application to a flooding problem. In: Buchberger, B., Campbell, J. (eds.) AISC 2004. LNCS (LNAI), vol. 3249, pp. 265–270. Springer, Heidelberg (2004)CrossRefGoogle Scholar
- 7.Kolisch, R., Padman, R.: An integrated survey of deterministic project scheduling. Omega 29, 249–272 (2001)CrossRefGoogle Scholar
- 8.Konieczny, S., Lang, J., Marquis, P.: Distance based merging: A general framework and some complexity results. In: Proc. of the 8th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2002), pp. 97–108 (2002)Google Scholar
- 9.Kuper, G., Libkin, G.L., Paradaens, J. (eds.): Constraint Databases. Springer, Heidelberg (2000)MATHGoogle Scholar
- 10.Leiserson, C.E., Saxe, J.B.: A mixed-integer linear programming problem which is efficiently solvable. In: Proc. of the 21st annual Allerton conference on Communications, Control, and Computing, pp. 204–213 (1983)Google Scholar
- 11.Lia, Y.Z., Wong, C.K.: An algorithm to compact a vlsi symbolic layout with mixed constraints. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems 2, 62–69 (1983)CrossRefGoogle Scholar
- 12.Lin, J., Mendelzon, A.: Knowledge Base Merging by Majority. In: Dynamic Worlds: From the Frame Problem to Knowledge Management. Applied Logic Series, vol. 12. Kluwer, Dordrecht (1999)Google Scholar
- 13.Rigaux, P., Scholl, M., Voisard, A.: Spatial Databases with Application to GIS. Morgan Kaufmann, San Francisco (2002)Google Scholar
- 14.Shostak, R.: Deciding linear inequalities by computing loop residues. Journal of ACM 28(4), 769–779 (1981)MATHCrossRefMathSciNetGoogle Scholar