{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T14:54:47Z","timestamp":1760799287250},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540009573"},{"type":"electronic","value":"9783540365969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36596-6_5","type":"book-chapter","created":{"date-parts":[[2007,10,24]],"date-time":"2007-10-24T21:23:52Z","timestamp":1193261032000},"page":"82-99","source":"Crossref","is-referenced-by-count":6,"title":["Soft Constraints and Heuristic Constraint Correction in Entity-Relationship Modelling"],"prefix":"10.1007","author":[{"given":"Sven","family":"Hartmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,4,1]]},"reference":[{"key":"5_CR1","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"An informal and efficient approach for obtaining semantic constraints using sample data and natural language processing","author":"M. Albrecht","year":"1996","unstructured":"M. Albrecht, E. Buchholz, A. D\u00fcsterh\u00f6ft, and B. Thalheim. An informal and efficient approach for obtaining semantic constraints using sample data and natural language processing. LNCS, 1358:1\u201311, 1996."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"D. Calvanese and M. Lenzerini. On the interaction between ISA and cardinality constraints. In Proc. of Tenth Int. Conf. on Data Engin., pp. 204\u2013213, 1994.","DOI":"10.1109\/ICDE.1994.283032"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s101070050058","volume":"85","author":"B. V. Cherkassy","year":"1998","unstructured":"B. V. Cherkassy and A. V. Goldberg. Negative cycle detection algorithms. Math. Programming, 85:277\u2013311, 1998.","journal-title":"Math. Programming"},{"key":"5_CR4","first-page":"129","volume":"73","author":"B. V. Cherkassy","year":"1996","unstructured":"B. V. Cherkassy, A. V. Goldberg, and T. Radzik. Shortest path algorithms: theory and experimental evaluation. Math. Programming, 73:129\u2013174, 1996.","journal-title":"Math. Programming"},{"key":"5_CR5","unstructured":"E. Di Nitto and L. Tanca. Dealing with deviations in DBMSs: an approach to revise consistency constraints. Integrity in Databases, FMLDO96, pp. 11\u201324. 1996."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0893-9659(93)90022-F","volume":"6","author":"A. V. Goldberg","year":"1993","unstructured":"A. V. Goldberg and T. Radzik. A heuristic improvement of the Bellman-Ford algorithm. Appl. Math. Letters, 6:3\u20136, 1993.","journal-title":"Appl. Math. Letters"},{"key":"5_CR7","unstructured":"M. Gondran and M. Minoux. Graphs and algorithms. Wiley, Chichecter, 1990."},{"key":"5_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/3-540-60618-1_71","volume-title":"Graphtheoretic methods to construct entity-relationship databases","author":"S. Hartmann","year":"1995","unstructured":"S. Hartmann. Graphtheoretic methods to construct entity-relationship databases. LNCS, 1017:131\u2013145, 1995."},{"key":"5_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/978-3-540-49524-6_12","volume-title":"On the consistency of int-cardinality constraints","author":"S. Hartmann","year":"1998","unstructured":"S. Hartmann. On the consistency of int-cardinality constraints. LNCS, 1507:150\u2013163, 1998."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1013133428451","volume":"33","author":"S. Hartmann","year":"2001","unstructured":"S. Hartmann. On the implication problem for cardinality constraints and functional dependencies. Annals Math. Artificial Intell., 33:253\u2013307, 2001.","journal-title":"Annals Math. Artificial Intell."},{"key":"5_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-45581-7_19","volume-title":"Coping with inconsistent constraint specifications","author":"S. Hartmann","year":"2001","unstructured":"S. Hartmann. Coping with inconsistent constraint specifications. LNCS, 2224:241\u2013255, 2001."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1145\/319628.319630","volume":"6","author":"W. Kent","year":"1981","unstructured":"W. Kent. Consequences of assuming a universal relation. ACM Trans. Database Syst., 6:539\u2013556, 1981.","journal-title":"ACM Trans. Database Syst."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"S. G. Kolliopoulos and C. Stein. Finding real-valued single source shortest paths in o(n 3) expected time. In Proc. 5th Int. Prog. Combin. Opt. Conf. 1996.","DOI":"10.1007\/3-540-61310-2_8"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01531267","volume":"9","author":"K. Kwast","year":"1993","unstructured":"K. Kwast. A deontic approach to database integrity. Annals Math. Artificial Intell., 9:205\u2013238, 1993.","journal-title":"Annals Math. Artificial Intell."},{"key":"5_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/3-540-63699-4_32","volume-title":"Resolving constraint confiicts in the integration of entityrelationship schemas","author":"M. L. Lee","year":"1997","unstructured":"M. L Lee and T. W. Ling. Resolving constraint confiicts in the integration of entityrelationship schemas. LNCS, 1331:394\u2013407, 1997."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/0306-4379(90)90048-T","volume":"15","author":"M. Lenzerini","year":"1990","unstructured":"M. Lenzerini and P. Nobili. On the satisfability of dependency constraints in entity-relationship schemata. Inform. Systems, 15:453\u2013461, 1990.","journal-title":"Inform. Systems"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0169-023X(93)90024-J","volume":"11","author":"S. W. Liddle","year":"1993","unstructured":"S. W. Liddle, D. W. Embley, and S. N. Woodfield. Cardinality constraints in semantic data models. Data Knowledge Engrg., 11:235\u2013270, 1993.","journal-title":"Data Knowledge Engrg."},{"key":"5_CR18","volume-title":"The design of relational databases","author":"H. Mannila","year":"1992","unstructured":"H. Mannila and K. R\u00e4ih\u00e4. The design of relational databases. Addison-Wesley, Reading, 1992."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"J.-J. Ch. Meyer, R. J. Wieringa, and F. P. M. Dignum. The role of deontic logic in the specification of information systems. In J. Chomicki and G. Saake, editors, Logics for databases and information systems, pages 71\u2013116. Kluwer, Dordrecht, 1998.","DOI":"10.1007\/978-1-4615-5643-5_4"},{"key":"5_CR20","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data structures and network algorithms","author":"R. E. Tarjan","year":"1983","unstructured":"R. E. Tarjan. Data structures and network algorithms. SIAM, Philadelphia, 1983."},{"key":"5_CR21","first-page":"197","volume":"6","author":"B. Thalheim","year":"1992","unstructured":"B. Thalheim. Foundations of entity-relationship modeling. Annals Math. Artificial Intell., 6:197\u2013256, 1992.","journal-title":"Annals Math. Artificial Intell."},{"key":"5_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04058-4","volume-title":"Entity-relationship modeling","author":"B. Thalheim","year":"2000","unstructured":"B. Thalheim. Entity-relationship modeling. Springer, Berlin, 2000."},{"key":"5_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/BFb0019915","volume-title":"Deductive object oriented schemas","author":"D. Theodorates","year":"1996","unstructured":"D. Theodorates. Deductive object oriented schemas. LNCS, 1157:58\u201372, 1996."}],"container-title":["Lecture Notes in Computer Science","Semantics in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36596-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T00:03:02Z","timestamp":1556928182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36596-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009573","9783540365969"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-36596-6_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}