Formal methods for the validation of automotive product configuration data

Artificial Intelligence for Engineering Design, Analysis and Manufacturing: AIEDAM

Volumn 17, Issue 1, 2003, Pages 75-97

  Sinz, Carsten ^a   Kaiser, Andreas ^a   Küchlin, Wolfgang ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Automotive product configuration; Formal methods; Management of change; Validation; Verification

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; CONSTRAINT THEORY; DATABASE SYSTEMS; DECISION MAKING;

AUTOMOTIVE PRODUCT CONFIGURATION; FORMAL METHODS; PRODUCT DATA MANAGEMENT;

FORMAL LOGIC;

EID: 0037529162     PISSN: 08900604     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0890060403171065     Document Type: Article

References (38)

1. Barker, V., & O'Connor, D. (1989). Expert systems for configuration at Digital: XCON and beyond. Communications of the ACM 32(3), 298-318.
2. Bayardo, R.J., & Schrag, R.C. (1997). Using CSP look-back techniques to solve real-world SAT instances. AAAI'97: Proc. Fourteenth National Conf. Artificial Intelligence.
3. Blochinger, W., Sinz, C., & Küchlin, W. (2001). Parallel consistency checking of automotive product data. Proc. Int. Conf. Parallel Computing (ParCo 2001), Naples, Italy.
4. CORBA, (1995). The Common Object Request Broker: Architecture and Specification. Needham, MA: Object Management Group.
5. Craigen, D., Gerhart, S., & Ralston, T. (1995). Formal methods reality check: Industrial usage. IEEE Transaction on Software Engineering 21(2), 90-98.
6. Davis, M., Logemann, G., & Loveland, D. (1962). A machine program for theorem-proving. Communications of the ACM 5, 394-397.
7. Davis, M., & Putnam, H. (1960). A computing procedure for quantification theory. Journal of the ACM 7, 201-215.
8. Davydov, D., Davydova, I., & Kleine Büning, H. (1988). An efficient algorithm for the minimal unsatisfiability problem for a sub-class of CNF. Annals of Mathematics and Artificial Intelligence 23, 229-245.
9. Freuder, E. (1998). The role of configuration knowledge in the business process. IEEE Intelligent Systems 13(4), 29-31.
10. Gerhart, S. (1990). Applications of formal methods: Developing virtuoso software. IEEE Software 7(5), 7-10.
11. Günter, A., & Kühn, C. (1999). Knowledge-based configuration: Survey and future directions. LNAI 1570, 47-66.
12. Haag, A. (1998), Sales configuration in business processes. IEEE Intelligent Systems 13(4), 78-85.
13. Hall, A. (1990). Seven myths of formal methods. IEEE Software 7(5), 11-19.
14. Hooker, J., & Vinay, V. (1995). Branching rules for satisfiability. Journal of Automated Reasoning 15(3), 359-383.
15. Kaiser, A. (2001). A SAT-based Propositional Prover for Consistency Checking of Automotive Product Data. Technical Report WSI-2001-16. Tübingen, Germany: Wilhelm-Schickard-Institut für Informatik, Eberhard-Karls-Universität Tübingen.
16. Kaiser, A., & Küchlin, W. (2001a). Detecting inadmissible and necessary variables in large propositional formulae. Proc. Intl. Joint Conf. Automated Reasoning: IJCAR 2001-Short Papers, pp. 96-102. Technical Report DII, 11/01. University of Siena.
17. Kaiser, A., & Küchlin, W. (2001b). Explaining inconsistencies in combinatorial automotive product data. Proc. 2nd Int. Conf. Intelligent Technologies (InTech 2001), pp. 198-204. Assumption University, Bangkok, Thailand.
18. Kleine Büning, H., & Xishun, Z. (1998). On the structure of some classes of minimal unsatisfiable formulas. Proc. 5th Int. Symp. Artificial Intelligence and Mathematics, Fort Lauderdale, FL.
19. Küchlin, W., & Sinz, C. (2000). Proving consistency assertions for automotive product data management. Journal of Automated Reasoning 24(1-2), 145-163.
20. Kullmann, O. (2000). An application of matroid theory to the SAT problem. Proc. 15th IEEE Conf. Computational Complexity-CCC 2000, pp. 116-124, Florence, Italy.
21. McDermott, J. (1982). R1: A rule-based configurer of computer systems. Artificial Intelligence 19(1), 39-88.
22. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an efficient SAT solver. Proc. 38th Design Automation Conf. (DAC 2001), pp. 530-535, New York: ACM.
23. Papadimitriou, C.H., & Wolfe, D. (1988). The complexity of facets resolved. Journal of Computer and System Sciences 37, 2-13.
24. Robinson, J.A. (1965). A machine-oriented logic based on the resolution principle. Journal of the ACM 12, 23-41.
25. Sabin, D., & Weigel, R. (1998). Product configuration framework-A survey. IEEE Intelligent Systems 13(4), 42-49.
26. Saiedian, H. (1996). An invitation to formal methods. IEEE Computer 29(4), 16-17.
27. Silva, J.P.M., & Sakallah, K.A. (1999). GRASP-A new search algorithm for satisfiability. IEEE Transactions on Computers 48(5), 506-521.
28. Sinz, C. (1997). Baubarkeitsprüfung von Kraftfahrzeugen durch automatisches Beweisen, Diplomarbeit, Universität Tübingen.
29. Sinz, C., & Küchlin, W. (2001). Dealing with temporal change in product documentation for manufacturing. Configuration Workshop Proc., 17th Int. Joint Conf. Artificial Intelligence (IJCAI-2001), pp. 71-77, Seattle, WA.
30. Soininen, T., Niemelä, I., Tiihonen, J., & Sulonen, R. (2001). Representing configuration knowledge with weight constraint rules. Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, 2001 AAAI Spring Symposium, pp. 195-201. Menlo Park, CA: AAAI Press.
31. Somenzi, F. (1998). CUDD: CU Decision Diagram Package, Release 2.3.0. University of Colorado, Boulder. Available online at http://vlsi.colorado.edu/~fabio.
32. Timmermans, P. (1999). The business challenge of configuration. In Configuration (Faltings, B., Freuder, E., Friedrich, G., & Felfernig, A., Eds.), pp. 119-122. Workshop Technical Report WS-99-05. Menlo Park, CA: AAAI Press.
33. Tseitin, G.S. (1970). On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic (Silenko, A.O., Ed.), pp. 115-125, Leningrad: V.A. Steklov Mathematical Institute.
34. Waldinger, R.J., & Stickel, M.E. (1992). Proving properties of rule based systems. International Journal of Software Engineering and Knowledge Engineering 2(1), 121-144.
35. Wing, J. (1990). A specifier's introduction to formal methods. IEEE Computer 23 (9), 8-24.
36. Wing, J., & Woodcock, J. (2000). Special issues for FM'99: The First World Congress on Formal Methods in the Development of Computing Systems. IEEE Transactions in Software Engineering 26(8), 673-674.
37. Wright, J.R., Weixelbaum, E., Vesonder, G.T., Brown, K.E., Palmer, S.R., Berman, J.I., & Moore, H.H. (1993). A knowledge-based configurator that supports sales, engineering, and manufacturing at AT&T Network Systems. AI Magazine 14(3), 69-80.
38. Zhang, H. (1997). SATO: An efficient propositional prover. Proc. 14th Int. Conf. on Automated Deduction (CADE-97), pp. 272-275. Lecture Notes in Computer Science, No. 1249. New York: Springer-Verlag.