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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and co, New York (1979)
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)
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)
Kolisch, R., Padman, R.: An integrated survey of deterministic project scheduling. Omega 29, 249–272 (2001)
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)
Kuper, G., Libkin, G.L., Paradaens, J. (eds.): Constraint Databases. Springer, Heidelberg (2000)
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)
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)
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)
Rigaux, P., Scholl, M., Voisard, A.: Spatial Databases with Application to GIS. Morgan Kaufmann, San Francisco (2002)
Shostak, R.: Deciding linear inequalities by computing loop residues. Journal of ACM 28(4), 769–779 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khelfallah, M., Benhamou, B. (2005). A Local Fusion Method of Temporal Information. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_41
Download citation
DOI: https://doi.org/10.1007/11518655_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27326-4
Online ISBN: 978-3-540-31888-0
eBook Packages: Computer ScienceComputer Science (R0)