-
Notifications
You must be signed in to change notification settings - Fork 6
/
library.bib
15666 lines (15594 loc) · 772 KB
/
library.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
Automatically generated by Mendeley 1.8.1
Any changes to this file will be lost if it is regenerated by Mendeley.
@article{Gottlob2002,
author = {Gottlob, Georg and Scarcello, Francesco and Sideri, Martha},
doi = {10.1016/S0004-3702(02)00182-0},
file = {:Users/alex/Documents/Mendeley Desktop/Gottlob, Scarcello, Sideri. 2002. Fixed-parameter complexity in AI and nonmonotonic reasoning.pdf:pdf},
issn = {00043702},
journal = {Artificial Intelligence},
keywords = {circumscription,conjunctive queries,constraint,fixed-parameter tractability,logic programming,nonmonotonic reasoning,parameterized complexity,prime implicants,satisfaction,stable models},
month = jun,
number = {1-2},
pages = {55--86},
title = {{Fixed-parameter complexity in AI and nonmonotonic reasoning}},
url = {http://linkinghub.elsevier.com/retrieve/pii/S0004370202001820},
volume = {138},
year = {2002}
}
@phdthesis{Een2005,
author = {Een, Niklas},
file = {:Users/alex/Documents/Mendeley Desktop/Een. 2005. SAT Based Model Checking. PhD Thesis.pdf:pdf},
pages = {90},
school = {Chalmers and GU},
title = {{SAT Based Model Checking. PhD Thesis}},
type = {phdthesis},
url = {http://swepub.kb.se/bib/swepub:oai:services.scigloo.org:4245?tab2=abs&language=en},
year = {2005}
}
@article{Besagni2004,
author = {Besagni, D. and Belad, a.},
doi = {10.1109/DIAL.2004.1263253},
isbn = {0-7695-2088-X},
journal = {First International Workshop on Document Image Analysis for Libraries, 2004. Proceedings.},
pages = {244--252},
publisher = {Ieee},
title = {{Citation recognition for scientific publications in digital libraries}},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1263253},
year = {2004}
}
@incollection{Azmi2009,
abstract = {This paper presents the illumination compensation technique for document images using local-global block analysis. Imbalance illumination will affect the performance of classification and segmentation process because the darker regions conceal the information of the image. This method will split the image into non-overlapped blocks, and utilize the information within the local and global area of the image. The output images were binarized with simple global thresholding technique and the result shows that the output image is comparable in quality with the existed method. A comparative result will be presented with other document binarization methods.},
author = {Azmi, Mohd. and {Iqbal Saripan}, M. and Azmir, Raja and Abdullah, Raja},
chapter = {60},
doi = {10.1007/978-3-642-05036-7_60},
editor = {{Badioze Zaman}, Halimah and Robinson, Peter and Petrou, Maria and Olivier, Patrick and Schr\"{o}der, Heiko and Shih, Timothy K.},
isbn = {978-3-642-05035-0},
keywords = {book,image_binarization,ocr,scan},
mendeley-tags = {book,image_binarization,ocr,scan},
pages = {636--644},
publisher = {Springer Berlin Heidelberg},
title = {{Illumination Compensation for Document Images Using Local-Global Block Analysis}},
type = {Book part (with own title)},
url = {http://www.springerlink.com/content/l63646h100w7j912},
volume = {5857},
year = {2009}
}
@inproceedings{Asin2009,
author = {As\'{\i}n, Roberto and Nieuwenhuis, Robert and Oliveras, Albert and Rodr\'{\i}guez-Carbonell, Enric},
booktitle = {Theory and Applications of Satisfiability Testing-SAT 2009},
doi = {10.1007/978-3-642-02777-2_18},
file = {:Users/alex/Documents/Mendeley Desktop/As\'{\i}n et al.. 2009. Cardinality Networks and Their Applications.pdf:pdf},
isbn = {3642027768},
pages = {167},
publisher = {Springer London, Limited},
title = {{Cardinality Networks and Their Applications}},
url = {http://books.google.com/books?hl=en&lr=&id=c5vK1W5HHuQC&oi=fnd&pg=PT178&dq=Cardinality+Networks+and+Their+Applications&ots=gzSX32HuV4&sig=uVuMlbyzozHTZ-F2HUWpettNt4I},
year = {2009}
}
@article{Warners1998,
abstract = {We present a technique that transforms a binary linear programming problem with integral coefficients to a satisfiability problem of propositional logic in linear time. Preliminary computational experience using this transformation, shows that a pure logical solver can be a valuable tool for solving specific binary linear programming problems, namely those that are in a sense ‘almost’ satisfiability problems. In a number of cases it competes favorably with well-known techniques from operations research.},
author = {Warners, J},
doi = {10.1016/S0020-0190(98)00144-6},
file = {:Users/alex/Documents/Mendeley Desktop/Warners. 1998. A linear-time transformation of linear inequalities into conjunctive normal form.pdf:pdf},
issn = {00200190},
journal = {Information Processing Letters},
month = oct,
number = {2},
pages = {63--69},
title = {{A linear-time transformation of linear inequalities into conjunctive normal form}},
type = {Journal article},
url = {http://linkinghub.elsevier.com/retrieve/pii/S0020019098001446},
volume = {68},
year = {1998}
}
@article{Kang2002,
author = {Kang, Kyo C and Donohoe, P.},
doi = {10.1109/MS.2002.1020288},
issn = {0740-7459},
journal = {IEEE Software},
month = jul,
number = {4},
pages = {58--65},
title = {{Feature-oriented product line engineering}},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1020288},
volume = {19},
year = {2002}
}
@inproceedings{Biere1999,
address = {Amsterdam, The Netherlands},
author = {Biere, Armin and Cimatti, Alessandro and Clarke, Edmund M. and Zhu, Yunshan},
booktitle = {5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems TACAS’99},
doi = {10.1007/3-540-49059-0_14},
number = {97},
pages = {193--207},
publisher = {Springer},
title = {{Symbolic Model Checking without BDDs}},
year = {1999}
}
@inproceedings{Darwiche2004,
address = {Valencia, Spain},
author = {Darwiche, Adnan},
booktitle = {Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI'2004},
editor = {de M\'{a}ntaras, Ramon L\'{o}pez and Saitta, Lorenza},
file = {:Users/alex/Documents/Mendeley Desktop/Darwiche. 2004. New Advances in Compiling CNF to Decomposable Negation Normal Form.pdf:pdf},
pages = {328--332},
publisher = {IOS Press},
series = {Frontiers in Artificial Intelligence and Applications},
title = {{New Advances in Compiling CNF to Decomposable Negation Normal Form}},
volume = {110},
year = {2004}
}
@article{Chen2005,
author = {Chen, G and Ma, Y-S and Thimm, G and Tang, S-H},
file = {:Users/alex/Documents/Mendeley Desktop/Chen et al.. 2005. Knowledge-Based Reasoning in a Unified Feature Modeling Scheme.pdf:pdf},
issn = {1686-4360},
journal = {Computer-Aided Design and Applications},
keywords = {constraint-based product development,feature-based modeling,knowledge-based reasoning,unified feature},
mendeley-tags = {constraint-based product development},
number = {1-4},
pages = {173--182},
title = {{Knowledge-Based Reasoning in a Unified Feature Modeling Scheme}},
url = {http://www.cadanda.com/V2Nos1to4_19.pdf},
volume = {2},
year = {2005}
}
@misc{Gecode,
keywords = {csp,gecode,software,solver},
mendeley-tags = {csp,gecode,software,solver},
title = {{Gecode: Generic constraint development environment}},
type = {Miscellaneous},
url = {http://www.gecode.org/}
}
@article{Dechter1996,
author = {Dechter, Rina and Dechter, Avi},
doi = {10.1016/0004-3702(94)00096-4},
file = {:Users/alex/Documents/Mendeley Desktop/Dechter, Dechter. 1996. Structure-driven algorithms for truth maintenance.pdf:pdf},
issn = {00043702},
journal = {Artificial Intelligence},
month = apr,
number = {1-2},
pages = {1--20},
title = {{Structure-driven algorithms for truth maintenance}},
url = {http://linkinghub.elsevier.com/retrieve/pii/0004370294000964},
volume = {82},
year = {1996}
}
@article{Lindahl1998STTT,
author = {Lindahl, Magnus and Pettersson, Paul and Yi, Wang},
doi = {10.1007/s100090100048},
file = {:Users/alex/Documents/Mendeley Desktop/Lindahl, Pettersson, Yi. 2001. Formal design and analysis of a gear controller.pdf:pdf},
journal = {International Journal on Software Tools for Technology Transfer (STTT)},
keywords = {automotive systems,design,mata,model checking,real-time systems,timed auto-},
number = {3},
pages = {353--368},
publisher = {Springer},
title = {{Formal design and analysis of a gear controller}},
url = {http://www.springerlink.com/content/yetww07tnx7nwdh3/},
volume = {3},
year = {2001}
}
@article{DeKleer1986,
author = {de Kleer, Johan},
doi = {10.1016/0004-3702(86)90080-9},
issn = {00043702},
journal = {Artificial Intelligence},
month = mar,
number = {2},
pages = {127--162},
title = {{An assumption-based TMS}},
url = {http://linkinghub.elsevier.com/retrieve/pii/0004370286900809},
volume = {28},
year = {1986}
}
@article{Darwiche2002,
author = {Darwiche, Adnan and Marquis, Pierre},
doi = {10.1613/jair.989},
file = {:Users/alex/Documents/Mendeley Desktop/Darwiche, Marquis. 2002. A knowledge compilation map.pdf:pdf},
journal = {Journal of Artificial Intelligence Research},
number = {1},
pages = {229--264},
publisher = {AI Access Foundation, Inc.},
title = {{A knowledge compilation map}},
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.65.5734&rep=rep1&type=pdf http://www.jair.org/papers/paper989.html},
volume = {17},
year = {2002}
}
@techreport{Sgorlon2008,
address = {Trento},
author = {Sgorlon, Stefano},
booktitle = {Technical Report DISI-09-013},
institution = {University of Trento},
number = {February},
title = {{A SAT-based tool for solving configuration problems. (Master's Thesis)}},
url = {http://eprints.biblio.unitn.it/archive/00001573/},
year = {2008}
}
@article{Samer2010a,
annote = { From Duplicate 2 ( Constraint satisfaction with bounded treewidth revisited - Samer, Marko; Szeider, Stefan )
},
author = {Samer, Marko and Szeider, Stefan},
doi = {10.1016/j.jcss.2009.04.003},
file = {:Users/alex/Documents/Mendeley Desktop/Samer, Szeider. 2010. Constraint satisfaction with bounded treewidth revisited.pdf:pdf},
issn = {00220000},
journal = {Journal of Computer and System Sciences},
keywords = {constraint satisfaction,parameterized complexity,treewidth},
month = mar,
number = {2},
pages = {103--114},
publisher = {Elsevier Inc.},
title = {{Constraint satisfaction with bounded treewidth revisited}},
url = {http://linkinghub.elsevier.com/retrieve/pii/S0022000009000300},
volume = {76},
year = {2010}
}
@inproceedings{Hadzic2008b,
address = {Dayton, OH},
author = {Hadzic, Tarik and Hansen, Esben Rune and O'Sullivan, Barry},
booktitle = {20th IEEE International Conference on Tools with Artificial Intelligence},
doi = {10.1109/ICTAI.2008.92},
file = {:Users/alex/Documents/Mendeley Desktop/Hadzic, Hansen, O'Sullivan. 2008. Layer Compression in Decision Diagrams.pdf:pdf},
isbn = {978-0-7695-3440-4},
month = nov,
number = {c},
pages = {19--26},
publisher = {IEEE},
title = {{Layer Compression in Decision Diagrams}},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4669667},
year = {2008}
}
@incollection{Cyrluk1997,
abstract = {In this paper we describe a decision procedure for the core theory of fixed-sized bit-vectors with extraction and composition that can readily be integrated into Shostak's procedure for deciding combinations of theories. Inputs to the solver are unquantified bit-vector equations t=u and the algorithm returns true if t=u is valid in the bit-vector theory, false if t=u is unsatisfiable, and a system of solved equations otherwise. The time complexity of the solver is $$\mathcal{O}\left( {\left| t \right| \cdot log{\text{ }}n + n^2 } \right)$$ , where t is the length of the bit-vector term t and n denotes the number of bits on either side of the equation. Then, the solver for the core bit-vector theory is extended to handle other bit-vector operations like bitwise logical operations, shifting, and arithmetic interpretations of bit-vectors. We develop a BDD-like data-structure called bit-vector BDDs to represent bit-vectors, various operations on bit-vectors, and a solver on bit-vector BDDs.},
author = {Cyrluk, David and M\"{o}ller, Oliver and Rue\ss, Harald},
booktitle = {Computer Aided Verification},
pages = {60--71},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
title = {{An efficient decision procedure for the theory of fixed-sized bit-vectors}},
type = {Book part (with own title)},
url = {http://www.springerlink.com/content/h346928l6j3h4731},
volume = {1254/1997},
year = {1997}
}
@inproceedings{seow04multiagent,
author = {Seow, Kiam-Tian and Ma, Chuan and Yokoo, Makoto},
booktitle = {Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004. Proceedings of the Third International Joint Conference on},
keywords = {control,planning,supervisory},
mendeley-tags = {control,planning,supervisory},
pages = {972--979},
title = {{Multiagent planning as control synthesis}},
type = {Conference proceedings (whole)},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1373616},
year = {2004}
}
@book{Pine1992,
abstract = {The mass production of standardized goods was the source of America's economic strength for generations and became the model for successful industries. Today, that model is a major cause of the nation's declining competitiveness. As Joe Pine makes clear, innovative companies are embracing a new paradigm of management--mass customization--that allows them to create greater variety and customization in their products and services at competitive prices, or better. He explains mass customization in its historical context, demonstrates why mass production cannot work in turbulent industries, and outlines how new forms of competition have led to greater variety and customization. Based upon academic and field research, his work is a thoughtful analysis and commentary on when and how managers in both service and manufacturing industries can make the transition to mass customization. He details the strategies, methods, and organizational transformations required to develop, produce, market, and deliver individually customized goods and services, and shows managers how to analyze their own industries to determine if they should shift to mass customization},
author = {{Pine II}, B. Joseph},
publisher = {Harvard Business Press Books},
title = {{Mass Customization: The New Frontier in Business Competition}},
year = {1992}
}
@inproceedings{Mittal1989,
author = {Mittal, Sanjay and Frayman, Felix},
booktitle = {Proceedings of the Eleventh International Joint Conference on Artificial Intelligence IJCAI-89},
file = {:Users/alex/Documents/Mendeley Desktop/Mittal, Frayman. 1989. Towards a generic model of configuration tasks.pdf:pdf},
pages = {1395--1401},
title = {{Towards a generic model of configuration tasks}},
url = {http://ijcai.org/Past Proceedings/IJCAI-89-VOL-2/PDF/087.pdf},
year = {1989}
}
@article{Thiel2002,
author = {Thiel, Steffen and Hein, Andreas},
doi = {10.1109/MS.2002.1020289},
file = {:Users/alex/Documents/Mendeley Desktop/Thiel, Hein. 2002. Modelling and using product line variability in automotive systems.pdf:pdf},
issn = {0740-7459},
journal = {IEEE Software},
month = jul,
number = {4},
pages = {66--72},
publisher = {IEEE},
title = {{Modelling and using product line variability in automotive systems}},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1020289},
volume = {19},
year = {2002}
}
@article{Greco2010,
author = {Greco, Gianluigi and Scarcello, Francesco},
doi = {10.1007/978-3-642-15396-9_21},
file = {:Users/alex/Documents/Mendeley Desktop/Greco, Scarcello. 2010. Structural tractability of enumerating CSP solutions.pdf:pdf},
journal = {Principles and Practice of Constraint Programming–CP 2010},
pages = {236--251},
publisher = {Springer},
title = {{Structural tractability of enumerating CSP solutions}},
url = {http://www.springerlink.com/index/L2270T03G5221346.pdf},
year = {2010}
}
@inproceedings{Felfernig2009,
author = {Felfernig, Alexander and Friedrich, Gerhard and Schubert, Monika and Mandl, Monika and Mairitsch, Markus and Teppan, Erich},
booktitle = {Proceedings of the 21st international jont conference on Artifical intelligence IJCAI-2009},
file = {:Users/alex/Documents/Mendeley Desktop/Felfernig et al.. 2009. Plausible repairs for inconsistent requirements.pdf:pdf},
keywords = {Knowledge Representation},
pages = {791--796},
publisher = {Morgan Kaufmann Publishers Inc.},
title = {{Plausible repairs for inconsistent requirements}},
url = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI-09/paper/viewFile/476/755},
year = {2009}
}
@inproceedings{Mannisto1999,
author = {M\"{a}nnist\"{o}, Tomi and Soininen, Timo and Tiihonen, Juha and Sulonen, Reijo},
booktitle = {Configuration Workshop at AAAI 1999},
file = {:Users/alex/Documents/Mendeley Desktop/M\"{a}nnist\"{o} et al.. 1999. Framework and Conceptual Model for Reconfiguration.pdf:pdf;:Users/alex/Documents/Mendeley Desktop/M\"{a}nnist\"{o} et al.. 1999. Framework and Conceptual Model for Reconfiguration(2).pdf:pdf},
title = {{Framework and Conceptual Model for Reconfiguration}},
url = {http://www.aaai.org/Papers/Workshops/1999/WS-99-05/WS99-05-011.pdf},
year = {1999}
}
@inproceedings{Libkin1996,
address = {New York, New York, USA},
author = {Libkin, Leonid and Machlin, Rona and Wong, Limsoon},
booktitle = {Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96},
doi = {10.1145/233269.233335},
file = {:Users/alex/Documents/Mendeley Desktop/Libkin, Machlin, Wong. 1996. A query language for multidimensional arrays design, implementation, and optimization techniques.pdf:pdf},
isbn = {0897917944},
pages = {228--239},
publisher = {ACM Press},
title = {{A query language for multidimensional arrays: design, implementation, and optimization techniques}},
url = {http://portal.acm.org/citation.cfm?doid=233269.233335},
year = {1996}
}
@article{Hu2012,
author = {Hu, Zhi Ming and Wang, Zhong Qi and Li, Ning and Wang, Hui Ping},
doi = {10.4028/www.scientific.net/AMR.542-543.251},
file = {:Users/alex/Documents/Mendeley Desktop/Hu et al.. 2012. Description Logics in Information Semantic Integration for Product Design and Manufacturing.pdf:pdf},
issn = {1662-8985},
journal = {Advanced Materials Research},
keywords = {description logics,knowledge,product information,reasoning,semantic integration},
month = jun,
pages = {251--254},
title = {{Description Logics in Information Semantic Integration for Product Design and Manufacturing}},
url = {http://www.scientific.net/AMR.542-543.251},
volume = {542-543},
year = {2012}
}
@article{Felfernig2011,
author = {Felfernig, Alexander and Schubert, Monika and Zehentner, Christoph},
doi = {10.1017/S0890060411000011},
issn = {0890-0604},
journal = {AI EDAM: Artificial Intelligence for Engineering Design, Analysis and Manufacturing},
month = jun,
number = {01},
pages = {53--62},
title = {{An efficient diagnosis algorithm for inconsistent constraint sets}},
url = {http://www.journals.cambridge.org/abstract_S0890060411000011 http://www.ist.tugraz.at/felfernig/images/dx_fastdiag.pdf},
volume = {26},
year = {2011}
}
@techreport{Bailleux2010,
archivePrefix = {arXiv},
arxivId = {arXiv:1012.3853v1},
author = {Bailleux, Olivier},
eprint = {arXiv:1012.3853v1},
file = {:Users/alex/Documents/Mendeley Desktop/Bailleux. 2010. On the CNF encoding of cardinality constraints and beyond.pdf:pdf},
pages = {1--8},
title = {{On the CNF encoding of cardinality constraints and beyond}},
year = {2010}
}
@incollection{Brandes2006,
abstract = {Spectral methods are naturally suited for dynamic graph layout, because moderate changes of a graph yield moderate changes of the layout under weak assumptions. We discuss some general principles for dynamic graph layout and derive a dynamic spectral layout approach for the animation of small-world models.},
author = {Brandes, Ulrik and Fleischer, Daniel and Puppe, Thomas},
pages = {25--36},
title = {{Dynamic Spectral Layout of Small Worlds}},
type = {Book part (with own title)},
url = {http://www.springerlink.com/content/f4q5777511315080},
year = {2006}
}
@inproceedings{Baumeister2006,
address = {Pod\v{e}brady, Czech Republic},
author = {Baumeister, Joachim and Seipel, Dietmar},
booktitle = {15th International Conference on Knowledge Engineering and Knowledge Management: Managing Knowledge in a World of Networks, EKAW-2006},
doi = {10.1007/11891451_11},
editor = {Staab, Steffen and Sv\'{a}tek, Vojt\v{e}ch},
file = {:Users/alex/Documents/Mendeley Desktop/Baumeister, Seipel. 2006. Verification and Refactoring of Ontologies with Rules.pdf:pdf},
issn = {0302-9743},
keywords = {anomaly detection,evaluation,knowledge engineering,measures},
pages = {82--95},
publisher = {Springer},
series = {LNCS},
title = {{Verification and Refactoring of Ontologies with Rules}},
url = {http://link.springer.com/chapter/10.1007/11891451_11},
volume = {4248},
year = {2006}
}
@article{Hadzic2004,
author = {Hadzic, Tarik and Subbarayan, Sathiamoorthy and Jensen, Rune M\o ller and Andersen, Henrik Reif and M\o ller, Jesper and Hulgaard, H.},
file = {:Users/alex/Documents/Mendeley Desktop/Hadzic et al.. 2004. Fast backtrack-free product configuration using a precompiled solution space representation.pdf:pdf},
journal = {PETO conference},
keywords = {binary decision diagrams,configuration space models,interactive product configuration},
publisher = {Citeseer},
title = {{Fast backtrack-free product configuration using a precompiled solution space representation}},
url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.101.7265&rep=rep1&type=pdf},
year = {2004}
}
@article{Felfernig2007,
abstract = {The effective integration of configuration system development with industrial software development is crucial for a successful implementation of a mass customization strategy. On the one hand, configuration knowledge bases must be easy to develop and maintain due to continuously changing product assortments. On the other hand, flexible integrations into existing enterprise applications, e-marketplaces and different facets of supply chain settings must be supported. This paper shows how the model-driven architecture (MDA) as an industrial framework for model development and interchange can serve as a foundation for standardized configuration knowledge representation, thus enabling knowledge sharing in heterogeneous environments. Using UML/Object Constraint Language as standard configuration knowledge representation languages, the representation of configuration domain-specific modeling concepts within MDA is shown and a formal semantics for these concepts is provided which allows a common understanding and interpretation of configuration task descriptions},
author = {Felfernig, Alexander},
doi = {10.1109/TEM.2006.889066},
file = {:Users/alex/Documents/Mendeley Desktop/Felfernig. 2007. Standardized Configuration Knowledge Representations as Technological Foundation for Mass Customization.pdf:pdf},
issn = {0018-9391},
journal = {IEEE Transactions on Engineering Management},
month = feb,
number = {1},
pages = {41--56},
title = {{Standardized Configuration Knowledge Representations as Technological Foundation for Mass Customization}},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4077230},
volume = {54},
year = {2007}
}
@inproceedings{Felfernig2010,
author = {Felfernig, Alexander and Schubert, Monika and Mandl, Monika and Friedrich, Gerhard and Teppan, Erich},
booktitle = {Proceeding of the 19th European Conference on Artificial Intelligence ECAI-2010},
doi = {10.3233/978-1-60750-606-5-1043},
file = {:Users/alex/Documents/Mendeley Desktop/Felfernig et al.. 2010. Efficient Explanations for Inconsistent Constraint Sets.pdf:pdf},
isbn = {9781607506065},
pages = {1043--1044},
publisher = {IOS Press},
title = {{Efficient Explanations for Inconsistent Constraint Sets}},
url = {http://portal.acm.org/citation.cfm?id=1861196},
year = {2010}
}
@article{White2008,
author = {White, J. and Schmidt, D.C. and Benavides, David and Trinidad, Pablo and Ruiz-cort\'{e}s, Antonio},
doi = {10.1109/SPLC.2008.16},
file = {:Users/alex/Documents/Mendeley Desktop/White et al.. 2008. Automated Diagnosis of Product-Line Configuration Errors in Feature Models.pdf:pdf},
isbn = {978-0-7695-3303-2},
journal = {2008 12th International Software Product Line Conference},
month = sep,
pages = {225--234},
publisher = {Ieee},
title = {{Automated Diagnosis of Product-Line Configuration Errors in Feature Models}},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4626856},
year = {2008}
}
@book{Srivas1996,
address = {Berlin/Heidelberg},
doi = {10.1007/BFb0031795},
editor = {Srivas, Mandayam and Camilleri, Albert},
isbn = {3-540-61937-2},
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science},
title = {{Formal Methods in Computer-Aided Design}},
url = {http://www.springerlink.com/index/10.1007/BFb0031795},
volume = {1166},
year = {1996}
}
@inproceedings{Velev2008,
abstract = {We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean satisfiability (SAT) problems against the only 2 previously used encodings. We also consider two symmetry-breaking heuristics. Compared to other methods for FPGA detailed routing, SAT-based approaches have the advantage that they can prove the unroutability of a global routing for a particular number of tracks per channel, and that they consider all nets simultaneously. The experiments were run on the standard MCNC benchmarks. The combination of one new encoding with a new symmetry-breaking heuristic resulted in speedup of 3 orders of magnitude or 1,139x of the total execution time on the collection of benchmarks, when proving the unroutability of FPGA global routings. The maximum obtained speedup was 9,499x on an individual benchmark. On the other hand, most of the encodings had comparable and very efficient performance when finding solutions for configurations that were routable. The availability of many SAT encodings, that can each be combined with various symmetry-breaking heuristics, opens the possibility to design portfolios of parallel strategies - each a combination of a SAT encoding and a symmetry- breaking heuristic - that can be run in parallel on different cores of a multicore CPU in order to reduce the solution time, with the rest of the runs terminated as soon as one of them returns an answer. We found that a portfolio of three particular parallel strategies produced additional speedup of more than 2x.},
author = {Velev, M.N. and Gao, Ping},
doi = {10.1109/DATE.2008.4484853},
keywords = {fpga,hardware,sat,sat-solver},
mendeley-tags = {fpga,hardware,sat,sat-solver},
month = mar,
pages = {1268--1273},
title = {{Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems}},
type = {Conference proceedings (whole)},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4484853},
year = {2008}
}
@inproceedings{Zhang1996SATO,
address = {Townsville, North Queensland, Australia},
author = {Zhang, Hantao},
booktitle = {14th International Conference on Automated Deduction},
doi = {10.1007/3-540-63104-6_28},
editor = {McCune, William},
number = {x},
pages = {272--275},
publisher = {Springer},
title = {{SATO: An Efficient Propositional Prover}},
volume = {2},
year = {1996}
}
@article{Asin2011,
author = {As\'{\i}n, Roberto and Nieuwenhuis, Robert and Oliveras, Albert and Rodr\'{\i}guez-Carbonell, Enric},
doi = {10.1007/s10601-010-9105-0},
file = {:Users/alex/Documents/Mendeley Desktop/As\'{\i}n et al.. 2011. Cardinality Networks a theoretical and empirical study.pdf:pdf},
issn = {1383-7133},
journal = {Constraints},
keywords = {cardinality constraints,sat,sat encodings},
month = jan,
number = {2},
pages = {195--221},
title = {{Cardinality Networks: a theoretical and empirical study}},
url = {http://www.springerlink.com/index/10.1007/s10601-010-9105-0},
volume = {16},
year = {2011}
}
@article{Levin2009,
abstract = {Abstract The significance of systems configurations has been increased in many applied domains (e.g., software, hardware, manufacturing systems, communication systems, supply chain systems, solving strategies, modular planning, material engineering and combinatorial chemistry). Generally, the following kinds of systems under configuration (reconfiguration) can be examined: (a) initial data/infomation (or row materials); (b) processing systems (machines, computers, algorithms); (c) resultant decisions (e.g., products, plans); (d) applied support systems (e.g., network systems, services); (e) requirements; and (f) standards. In the paper several system configuration problems are investigated: (i) searching for (selection of) a set (structure) of system components, (ii) searching for a set of compatible system components, (iii) allocation of system components, (iv) reconfiguration of a system as redesign of the system structure, (v) multi-stage design and redesign of system configuration, (vi) design or redesign of the system configuration for multi-product systems, and (vii) design of system hierarchy. Combinatorial optimization models (including multicriteria statements) are under examination: multiple choice problem, allocation problem, graph coloring problems, morphological clique problem (with compatibility of system components), multipartite clique and their modifications, spanning trees problems.},
author = {Levin, M.},
doi = {10.1134/S0005117909030187},
issn = {0005-1179},
journal = {Automation and Remote Control},
keywords = {applications,configuration,optimization,review},
mendeley-tags = {applications,configuration,optimization,review},
month = mar,
number = {3},
pages = {519--561},
title = {{Combinatorial optimization in system configuration design}},
type = {Journal article},
url = {http://www.springerlink.com/content/496087611327p44h},
volume = {70},
year = {2009}
}
@article{Helo2006,
author = {Helo, P.T.},
doi = {10.1108/02635570610688896},
file = {:Users/alex/Documents/Mendeley Desktop/Helo. 2006. Product configuration analysis with design structure matrix.pdf:pdf},
issn = {0263-5577},
journal = {Industrial Management & Data Systems},
number = {7},
pages = {997--1011},
title = {{Product configuration analysis with design structure matrix}},
url = {http://www.emeraldinsight.com/10.1108/02635570610688896},
volume = {106},
year = {2006}
}
@inproceedings{Junker2004,
abstract = {Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user of an interactive application, however, desires explanations and relaxations containing the most important constraints. To address this need, we define preferred explanations and relaxations based on user preferences between constraints and we compute them by a generic method which works for arbitrary CP, SAT, or DL solvers. We significantly accelerate the basic method by a divide-and-conquer strategy and thus provide the technological basis for the explanation facility of a principal industrial constraint programming tool, which is, for example, used in numerous configuration applications.},
address = {San Jose, CA},
author = {Junker, Ulrich},
booktitle = {AAAI 2004},
file = {:Users/alex/Documents/Mendeley Desktop/Junker. 2004. QuickXplain Preferred Explanations and Relaxations for Over-Constrained Problems.pdf:pdf},
pages = {167--172},
title = {{QuickXplain: Preferred Explanations and Relaxations for Over-Constrained Problems}},
url = {http://www.aaai.org/Papers/AAAI/2004/AAAI04-027.pdf},
volume = {3},
year = {2004}
}
@phdthesis{Fuxin2005,
author = {Fuxin, Freddy},
file = {:Users/alex/Documents/Mendeley Desktop/Fuxin. 2005. Evolution and communication of geometry based product information within an extended enterprise (PhD thesis).pdf:pdf},
school = {Lule\aa tekniska universitet},
title = {{Evolution and communication of geometry based product information within an extended enterprise (PhD thesis)}},
url = {http://epubl.ltu.se/1402-1544/2005/04/},
year = {2005}
}
@book{Rossi2006,
author = {Rossi, Francesca and van Beek, Peter and Walsh, Toby},
editor = {Rossi, Francesca and van Beek, Peter and Walsh, Toby},
isbn = {9780444527264},
keywords = {ai,constraint,constraint_programming,csp,programming},
mendeley-tags = {ai,constraint,constraint_programming,csp,programming},
publisher = {Elsevier},
title = {{Handbook of Constraint Programming: Foundations of Artificial Intelligence}},
type = {Book},
url = {http://www.amazon.com/exec/obidos/ASIN/0444527265/acmorg-20 http://portal.acm.org/citation.cfm?id=1207782 http://www.sciencedirect.com/science/bookseries/15746526/2},
year = {2006}
}
@article{HadjLafortune94,
abstract = {In cases where the discrete-event system model has an infinite or large state space, or when it is not completely specified a priori, applying the traditional off-line methods for computing the control policy may be impractical, if not infeasible. We adopt an online limited lookahead approach. Under this approach, the next control action is determined based on an N-step ahead projection of the system behavior and on one of two attitudes-conservative or optimistic. We extend this approach to incorporate knowledge of the system state in the computation. This has the potential of improving the efficiency of the computation as well as the quality of the control policy. There are five specific contributions presented in this paper: 1) a new algorithm for the online computation of supervisory controls with worst case complexity that is quadratic in the number of “expanded” states, 2) an algorithmic proof of the correctness of this algorithm that avoids using fixed point methods and offers new insight into the structure of the supremal controllable sublanguage, 3) an off-line version based on a forward search technique that has the same worst case complexity as existing off-line algorithms but is potentially more efficient, 4) a formal proof of the fact that when the languages of interest are livelock free the computations are performed in linear complexity, and 5) new bounds on the depth of the lookahead window that guarantee optimality},
author = {Hadj-Alouane, N.B. and Lafortune, Stephane and Lin, Feng},
doi = {10.1109/9.362854},
journal = {Automatic Control, IEEE Transactions on},
keywords = {sat,supervisory},
mendeley-tags = {sat,supervisory},
number = {12},
pages = {2398--2410},
title = {{Variable lookahead supervisory control with state information}},
type = {Journal article},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=362854},
volume = {39},
year = {1994}
}
@article{Liffiton2008,
author = {Liffiton, Mark H and Mneimneh, Maher and Lynce, In\^{e}s and Andraus, Zaher and Marques-Silva, Joao P. and Sakallah, Karem A.},
doi = {10.1007/s10601-008-9058-8},
file = {:Users/alex/Documents/Mendeley Desktop/Liffiton et al.. 2008. A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas.pdf:pdf},
issn = {1383-7133},
journal = {Constraints},
month = aug,
number = {4},
pages = {415--442},
title = {{A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas}},
url = {http://www.springerlink.com/index/10.1007/s10601-008-9058-8},
volume = {14},
year = {2008}
}
@inproceedings{Batory2005,
address = {Rennes, France},
annote = { From Duplicate 1 ( Feature Models , Grammars , and Propositional Formulas - Batory, Don S. )
},
author = {Batory, Don S.},
booktitle = {9th International Conference on Software Product Lines},
doi = {10.1007/11554844_3},
editor = {Obbink, Henk and Pohl, Klaus},
file = {:Users/alex/Documents/Mendeley Desktop/Batory. 2005. Feature Models, Grammars, and Propositional Formulas.pdf:pdf},
pages = {7 -- 20},
publisher = {Springer},
series = {LNCS},
title = {{Feature Models, Grammars, and Propositional Formulas}},
volume = {3714},
year = {2005}
}
@article{Gottlob2005,
author = {Gottlob, Georg and Koch, Christoph and Pichler, Reinhard},
doi = {10.1145/1071610.1071614},
file = {:Users/alex/Documents/Mendeley Desktop/Gottlob, Koch, Pichler. 2005. Efficient algorithms for processing XPath queries.pdf:pdf},
issn = {03625915},
journal = {ACM Transactions on Database Systems},
month = jun,
number = {2},
pages = {444--491},
title = {{Efficient algorithms for processing XPath queries}},
url = {http://portal.acm.org/citation.cfm?doid=1071610.1071614},
volume = {30},
year = {2005}
}
@article{Haug2012,
author = {Haug, Anders and Hvam, Lars and Mortensen, Niels Henrik},
doi = {10.1016/j.compind.2012.02.001},
file = {:Users/alex/Documents/Mendeley Desktop/Haug, Hvam, Mortensen. 2012. Definition and evaluation of product configurator development strategies.pdf:pdf},
issn = {01663615},
journal = {Computers in Industry},
keywords = {knowledge acquisition,product configuration,product configurator},
month = jun,
number = {5},
pages = {471--481},
publisher = {Elsevier B.V.},
title = {{Definition and evaluation of product configurator development strategies}},
url = {http://linkinghub.elsevier.com/retrieve/pii/S0166361512000267},
volume = {63},
year = {2012}
}
@inproceedings{Marques-Silva2008,
abstract = {Boolean satisfiability (SAT) solvers have been the subject of remarkable improvements since the mid 90s. One of the main reasons for these improvements has been the wide range of practical applications of SAT. Indeed, examples of modern applications of SAT range from termination analysis in term-rewrite systems to circuit-level prediction of crosstalk noise. The success of SAT solvers motivated many practical applications, but many practical applications have also provided the examples and the challenges that allowed the development of more efficient SAT solvers. This paper provides an overview of some of the most well-known applications of SAT and outlines several other successful applications of SAT. Moreover, the improvements in SAT solvers motivated the development of new algorithms for strategic extensions of SAT. As a result, the paper also provides a brief survey of recent work on extensions of SAT, including pseudo-Boolean constraints, maximum satisfiability, model counting and quantified Boolean formulas.},
address = {G\"{o}teborg, Sweden},
author = {Marques-Silva, Joao P.},
booktitle = {9th International Workshop on Discrete Event Systems WODES-2008},
doi = {10.1109/WODES.2008.4605925},
isbn = {978-1-4244-2592-1},
month = may,
pages = {74--80},
publisher = {IEEE},
title = {{Practical applications of Boolean Satisfiability}},
type = {Conference proceedings (article)},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4605925 http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4605925},
year = {2008}
}
@article{Darwiche1998,
author = {Darwiche, Adnan},
file = {:Users/alex/Documents/Mendeley Desktop/Darwiche. 1998. Model-Based Diagnosis using Structured System Descriptions.pdf:pdf},
journal = {Journal of Artificial Intelligence Research},
pages = {165--222},
title = {{Model-Based Diagnosis using Structured System Descriptions}},
volume = {8},
year = {1998}
}
@inproceedings{Schulze2012,
address = {New York, New York, USA},
author = {Schulze, Sandro and Th\"{u}m, Thomas and Kuhlemann, Martin and Saake, Gunter},
booktitle = {Proceedings of the Sixth International Workshop on Variability Modeling of Software-Intensive Systems - VaMoS '12},
doi = {10.1145/2110147.2110156},
file = {:Users/alex/Documents/Mendeley Desktop/Schulze et al.. 2012. Variant-preserving refactoring in feature-oriented software product lines.pdf:pdf},
isbn = {9781450310581},
keywords = {code clones,feature-oriented pro-,gramming,refactoring,software product lines},
pages = {73--81},
publisher = {ACM Press},
title = {{Variant-preserving refactoring in feature-oriented software product lines}},
url = {http://dl.acm.org/citation.cfm?doid=2110147.2110156},
year = {2012}
}
@inproceedings{Jussien2001,
author = {Jussien, Narendra},
booktitle = {Proc. CP01 Workshop on User-Interaction in Constraint Satisfaction, Paphos, Cyprus},
file = {:Users/alex/Documents/Mendeley Desktop/Jussien. 2001. e-Constraints Explanation-based constraint programming.pdf:pdf},
title = {{e-Constraints: Explanation-based constraint programming}},
url = {http://www.emn.fr/jussien/publications/jussien-WCP01.pdf},
year = {2001}
}
@phdthesis{Sannella1994,
author = {Sannella, Michael},
file = {:Users/alex/Documents/Mendeley Desktop/Sannella. 1994. Constraint satisfaction and debugging for interactive user interfaces.pdf:pdf},
number = {3},
school = {University of Washington, Seattle, WA},
title = {{Constraint satisfaction and debugging for interactive user interfaces (PhD thesis)}},
year = {1994}
}
@incollection{Gries2005,
author = {Gries, Matthias and Jin, Yujia},
booktitle = {Building ASIPs: The MESCAL Methodology},
doi = {10.1007/0-387-26128-1_5},
file = {:Users/alex/Documents/Mendeley Desktop/Gries, Jin. 2005. Comprehensively Exploring the Design Space.pdf:pdf},
pages = {131--177},
publisher = {Springer},
title = {{Comprehensively Exploring the Design Space}},
url = {http://www.springerlink.com/index/pl266132r552w706.pdf},
year = {2005}
}
@article{Trentin2011,
author = {Trentin, Alessio and Perin, Elisa and Forza, Cipriano},
doi = {10.1016/j.compind.2010.09.002},
file = {:Users/alex/Documents/Mendeley Desktop/Trentin, Perin, Forza. 2011. Overcoming the customization-responsiveness squeeze by using product configurators Beyond anecdotal evidence.pdf:pdf},
issn = {01663615},
journal = {Computers in Industry},
month = apr,
number = {3},
pages = {260--268},
publisher = {Elsevier B.V.},
title = {{Overcoming the customization-responsiveness squeeze by using product configurators: Beyond anecdotal evidence}},
url = {http://linkinghub.elsevier.com/retrieve/pii/S0166361510001302},
volume = {62},
year = {2011}
}
@inproceedings{Pipatsrisawat2008,
author = {Pipatsrisawat, Knot and Darwiche, Adnan},
booktitle = {Proc. of AAAI},
file = {:Users/alex/Documents/Mendeley Desktop/Pipatsrisawat, Darwiche. 2008. New compilation languages based on structured decomposability.pdf:pdf},
keywords = {dnnf},
mendeley-tags = {dnnf},
pages = {517--522},
title = {{New compilation languages based on structured decomposability}},
url = {http://www.aaai.org/Papers/AAAI/2008/AAAI08-082.pdf},
volume = {8},
year = {2008}
}
@article{McDermott1982,
author = {McDermott, John},
doi = {10.1016/0004-3702(82)90021-2},
file = {:Users/alex/Documents/Mendeley Desktop/McDermott. 1982. R1 A rule-based configurer of computer systems.pdf:pdf},
issn = {00043702},
journal = {Artificial Intelligence},
month = sep,
number = {1},
pages = {39--88},
title = {{R1: A rule-based configurer of computer systems}},
url = {http://linkinghub.elsevier.com/retrieve/pii/0004370282900212},
volume = {19},
year = {1982}
}
@inproceedings{Dechter2008,
author = {Dechter, Rina and Otten, Lars and Marinescu, Radu},
booktitle = {ECAI 2008},
file = {:Users/alex/Documents/Mendeley Desktop/Dechter, Otten, Marinescu. 2008. On the Practical Significance of Hypertree vs Tree Width.pdf:pdf},
pages = {913--914},
publisher = {IOS Press},
title = {{On the Practical Significance of Hypertree vs Tree Width}},
year = {2008}
}
@incollection{Mateescu2008b,
author = {Mateescu, Robert and Dechter, Rina},
booktitle = {Concurrency, Graphs and Models. Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday},
doi = {10.1007/978-3-540-68679-8_15},
editor = {Degano, Pierpaolo and Nicola, Rocco De and Meseguer, Jos\'{e}},
file = {:Users/alex/Documents/Mendeley Desktop/Mateescu, Dechter. 2008. ANDOR Multi-valued Decision Diagrams for Constraint Networks.pdf:pdf},
isbn = {978-3-540-68676-7},
pages = {238--257},
publisher = {Springer},
series = {LNCS},
title = {{AND/OR Multi-valued Decision Diagrams for Constraint Networks}},
volume = {5056},
year = {2008}
}
@inproceedings{Tidstam2010,
address = {G\"{o}teborg, Sweden},
author = {Tidstam, Anna and Malmqvist, Johan},
booktitle = {Proceedings of NordDesign 2010},
title = {{Information Modelling for Automotive Configuration}},
year = {2010}
}
@inproceedings{Asikainen2004,
author = {Asikainen, Timo and M\"{a}nnist\"{o}, Tomi and Soininen, Timo},
booktitle = {ECAI 2004},
file = {:Users/alex/Documents/Mendeley Desktop/Asikainen, M\"{a}nnist\"{o}, Soininen. 2004. Representing Feature Models of Software Product Families Using a Configuration Ontology.pdf:pdf},
pages = {1--6},
title = {{Representing Feature Models of Software Product Families Using a Configuration Ontology}},
year = {2004}
}
@incollection{Sheeran2000,
abstract = {We take a fresh look at the problem of how to check safety properties of finite state machines. We are particularly interested in checking safety properties with the help of a SAT-solver. We describe some novel induction-based methods, and show how they are related to more standard fixpoint algorithms for invariance checking. We also present preliminary experimental results in the verification of FPGA cores. This demonstrates the practicality of combining a SAT-solver with induction for safety property checking of hardware in a real design flow.},
author = {Sheeran, Mary and Singh, Satnam and St\aa lmarck, Gunnar},
booktitle = {Formal Methods in Computer-Aided Design},
doi = {10.1007/3-540-40922-X_8},
keywords = {induction,sat,solver,temporal},
mendeley-tags = {induction,sat,solver,temporal},
pages = {127--144},
title = {{Checking Safety Properties Using Induction and a SAT-Solver}},
type = {Book part (with own title)},
year = {2000}
}
@book{Apt2003,
author = {Apt, Krzysztof},
isbn = {9780521825832},
pages = {420},
publisher = {Cambridge University Press},
title = {{Principles of Constraint Programming}},
year = {2003}
}
@inproceedings{Gottlab07,
address = {Hyderabad, India},
author = {Gottlob, Georg and Greco, Gianluigi and Mancini, Toni},
booktitle = {IJCAI-2007},
editor = {Veloso, Manuela M.},
keywords = {conditional-csp,configuration,csp,dynamic-csp},
mendeley-tags = {conditional-csp,configuration,csp,dynamic-csp},
month = jan,
pages = {88--93},
title = {{Conditional Constraint Satisfaction: Logical Foundations and Complexity}},
type = {Conference proceedings (article)},
url = {http://dli.iiit.ac.in/ijcai/IJCAI-2007/PDF/IJCAI07-012.pdf},
year = {2007}
}
@inproceedings{Fhager2007,
abstract = {In this paper an iterative electromagnetic time-domain inversion algorithm is described and modified to include a priori data of the shape and dielectric properties of an object being imaged. The algorithm is based on solving the regular and the adjoint Maxwell's equations in order to compute gradients, which are used to update the dielectric profile with the conjugate-gradient method. As an alternative a global optimisation algorithm, the particle swarm optimisation method, has also been investigated. The results show that by exploiting a priori dielectric data in this way a significant improvement in the resolving ability can be obtained. Finally Tikonov and edge preserving regularisation has been investigated and a modified regularisation scheme, supporting the a priori data is suggested},
author = {Fhager, Andreas and Voronov, Alexey and Chen, C. and Persson, Mikael},
booktitle = {The Second European Conference on Antennas and Propagation, EuCAP 2007},
file = {:Users/alex/Documents/Mendeley Desktop/Fhager et al.. 2007. Methods for Dielectric Reconstruction in Microwave Tomography.pdf:pdf},
keywords = {fdtd,me,microwave,tomography},
mendeley-tags = {fdtd,me,microwave,tomography},
pages = {1--6},
title = {{Methods for Dielectric Reconstruction in Microwave Tomography}},
type = {Conference proceedings (whole)},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4458387},
year = {2007}
}
@inproceedings{Queille1982,
address = {London, UK},
author = {Queille, Jean-Pierre P. and Sifakis, Joseph},
booktitle = {Proceedings of the 5th Colloquium on International Symposium on Programming},
doi = {10.1007/3-540-11494-7},
editor = {Dezani-Ciancaglini, Mariangiola and Montanari, Ugo},
file = {:Users/alex/Documents/Mendeley Desktop/Queille, Sifakis. 1982. Specification and verification of concurrent systems in CESAR.pdf:pdf},
isbn = {3-540-11494-7},
pages = {337--351},
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science},
title = {{Specification and verification of concurrent systems in CESAR}},
url = {http://www.springerlink.com/index/7X327643572334RW.pdf},
volume = {137},
year = {1982}
}
@inproceedings{Frey05application,
abstract = {The developer of logic control systems is faced with increasing complexity of the functions to be implemented and, at the same time, increasing demands on the reliability of the resulting software. To analyze the reliability of such complex systems formal methods can be applied. One area of the corresponding research is focused on the application of model checking techniques to Programmable Logic Controllers (PLCs). In this paper a new method to formalize PLC programs together with a model of the cyclic behavior of the PLC is presented. The control systems behavior is modeled, and then the program, written in Instruction List, is formalized and integrated into the model. The formalization in SMV language is suitable for verification using BDD and SAT techniques. Both techniques are compared using first results of a case study.},
author = {Loeis, K. and Younis, M.B. and Frey, G.},
booktitle = {Emerging Technologies and Factory Automation, 2005. ETFA 2005. 10th IEEE Conference on},
doi = {10.1109/ETFA.2005.1612527},
keywords = {bdd,bmc,des,germany,plc,sat},
mendeley-tags = {bdd,bmc,des,germany,plc,sat},
title = {{Application of symbolic and bounded model checking to the verification of logic control systems}},
type = {Conference proceedings (whole)},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1612527},
volume = {1},
year = {2005}
}
@article{Cohen2008,
author = {Cohen, David and Jeavons, Peter G. and Gyssens, Marc},
doi = {10.1016/j.jcss.2007.08.001},
file = {:Users/alex/Documents/Mendeley Desktop/Cohen, Jeavons, Gyssens. 2008. A unified theory of structural tractability for constraint satisfaction problems.pdf:pdf},
issn = {00220000},
journal = {Journal of Computer and System Sciences},
keywords = {complexity,constraints,hypertree,structural decomposition},
month = aug,
number = {5},
pages = {721--743},
title = {{A unified theory of structural tractability for constraint satisfaction problems}},
url = {http://linkinghub.elsevier.com/retrieve/pii/S0022000007001225},
volume = {74},
year = {2008}
}
@article{Batory2006,
author = {Batory, Don S. and Benavides, David and Ruiz-cort\'{e}s, Antonio},
doi = {10.1145/1183236.1183264},
file = {:Users/alex/Documents/Mendeley Desktop/Batory, Benavides, Ruiz-cort\'{e}s. 2006. Automated analysis of feature models challenges ahead.pdf:pdf},
issn = {00010782},
journal = {Communications of the ACM},
month = dec,
number = {12},
pages = {45},
title = {{Automated analysis of feature models: challenges ahead}},
url = {http://portal.acm.org/citation.cfm?doid=1183236.1183264},
volume = {49},
year = {2006}
}
@inproceedings{Samer2008,
address = {Chicago, Illinois, USA},
author = {Samer, Marko and Szeider, Stefan},
booktitle = {Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence - AAAI'2008},
file = {:Users/alex/Documents/Mendeley Desktop/Samer, Szeider. 2008. Backdoor Trees.pdf:pdf},
keywords = {Constraints Satisfiability and Search},
pages = {363--368},
publisher = {AAAI Press},
title = {{Backdoor Trees}},
url = {http://www.aaai.org/Papers/AAAI/2008/AAAI08-057.pdf},
year = {2008}
}
@inproceedings{Norgaard2009,
author = {N\o rgaard, Andreas Hau and Boysen, Morten Riiskjaer and Jensen, Rune M\o ller and Tiedemann, Peter},
booktitle = {Proceedings of the 21st International Joint Conferences on Artificial Intelligence(IJCAI-09) Workshop on Configuration},
file = {:Users/alex/Documents/Mendeley Desktop/N\o rgaard et al.. 2009. Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration.pdf:pdf},
title = {{Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration}},
year = {2009}
}
@inproceedings{Gomes1998,
abstract = {Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of “heavy-tailed cost distributions”, meaning that at any time during the experiment there is a non-negligible probability of hitting a problem that requires exponentially more time to solve than any that has been encountered before (Gomes et al. 1998a). We present a general method for introducing con- trolled randomization into complete search algorithms. The “boosted” search methods provably eliminate heavy-tails to the right of the median. Furthermore, they can take advan- tage of heavy-tails to the left of the median (that is, a non- negligible chance of very short runs) to dramatically shorten the solution time. We demonstrate speedups of several or- ders of magnitude for state-of-the-art complete search pro- cedures running on hard, real-world problems.},
author = {Gomes, Carla P. and Selman, Bart and Kautz, Henry},
booktitle = {AAAI 1998},
file = {:Users/alex/Documents/Mendeley Desktop/Gomes, Selman, Kautz. 1998. Boosting Combinatorial Search Through Randomization.pdf:pdf},
title = {{Boosting Combinatorial Search Through Randomization}},
url = {http://www.aaai.org/Papers/AAAI/1998/AAAI98-061.pdf},
year = {1998}
}
@misc{LeBerre,
author = {{Le Berre}, Daniel},
title = {{Sat4j. http://www.sat4j.org}},
type = {Miscellaneous}
}
@article{Biere03bmc,
abstract = {Symbolic model checking with Binary Decision Diagrams (BDDs) has been successfully used in the last decade for formally verifying finite state systems such as sequential circuits and protocols. Since its introduction in the beginning of the 90's, it has been integrated in the quality assurance process of several major hardware companies. The main bottleneck of this method is that BDDs may grow exponentially, and hence the amount of available memory restricts the size of circuits that can...},
author = {Biere, Armin and Cimatti, Alessandro and Clarke, Edmund M. and Strichman, Ofer and Zhu, Yunshan},
doi = {10.1016/S0065-2458(03)58003-2},
journal = {Advances in Computers},
keywords = {sat},
mendeley-tags = {sat},
pages = {118--149},
publisher = {Elsevier},
title = {{Bounded Model Checking}},
type = {Miscellaneous},
volume = {58},
year = {2003}
}
@inproceedings{Subbarayan2005,
address = {Prague, Czech Republic},
annote = { From Duplicate 2 ( Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems - Subbarayan, Sathiamoorthy )
},
author = {Subbarayan, Sathiamoorthy},
booktitle = {Second International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2005},
doi = {10.1007/11493853_26},
editor = {Bart\'{a}k, Roman and Milano, Michela},
file = {:Users/alex/Documents/Mendeley Desktop/Subbarayan. 2005. Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems.pdf:pdf;:Users/alex/Documents/Mendeley Desktop/Subbarayan. 2005. Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems(2).pdf:pdf},
pages = {351--365},
publisher = {Springer},
series = {LNCS},
title = {{Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems}},
volume = {3524/2005},
year = {2005}
}
@article{Bryant1986,
abstract = {In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical applications have a more reasonable representation. Our algorithms have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large. We present experimental results from applying these algorithms to problems in logic design verification that demonstrate the practicality of our approach.},
author = {Bryant, Randal E.},
doi = {10.1109/TC.1986.1676819},
file = {:Users/alex/Documents/Mendeley Desktop/Bryant. 1986. Graph-Based Algorithms for Boolean Function Manipulation.pdf:pdf},
issn = {0018-9340},
journal = {IEEE Transactions on Computers},
month = aug,
number = {8},
pages = {677--691},
publisher = {IEEE Computer Society},
title = {{Graph-Based Algorithms for Boolean Function Manipulation}},
type = {Journal article},
url = {http://dx.doi.org/10.1109/TC.1986.1676819},
volume = {C-35},
year = {1986}
}
@article{Yan2008,
author = {Yan, Huiqiang and Tan, Runhua and Ping, Jiang and Shi, Kangyun},
doi = {10.1109/IITA.2008.170},
file = {:Users/alex/Documents/Mendeley Desktop/Yan et al.. 2008. Platform-Based Product Configuration Research.pdf:pdf},
isbn = {978-0-7695-3497-8},
journal = {2008 Second International Symposium on Intelligent Information Technology Application},
month = dec,
pages = {828--832},
publisher = {Ieee},
title = {{Platform-Based Product Configuration Research}},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4739687},
year = {2008}
}
@article{Preece1997,
abstract = {Validation has emerged as a significant problem in the development of knowledge- based systems (KBS). Verification of KBS correctness and completeness has been cited as one of the most difficult aspects of validation. A number of software tools have been developed to perform such verification, but none of these are in widespread use. One of the reasons for this is that little quantitative evidence exists to demonstrate the effectiveness of the tools. This paper presents an experimental study of three KBS verification tools: a consistency checker, a completeness checker and a testing tool (for correctness). The tools are evaluated on their ability to reveal plausible faults seeded into a complex, realistic KBS application. The cost of using the tools is also measured. It is shown that each tool is independently effective at detecting certain kinds of fault and that the capabilities of the tools are complementary—a result not revealed by previous studies.},
author = {Preece, Alun D. and Talbot, St\'{e}phane and Vignollet, Laurence},
doi = {10.1006/ijhc.1997.0152},
file = {:Users/alex/Documents/Mendeley Desktop/Preece, Talbot, Vignollet. 1997. Evaluation of verification tools for knowledge-based systems.pdf:pdf},
issn = {10715819},
journal = {International Journal of Human-Computer Studies},
month = nov,
number = {5},