This book constitutes the thoroughly refereed joint post-proceedings of the 15th International Conference on Applications of Declarative Programming and Knowledge Management, INAP 2004, and the 18th Workshop on Logic Programming, WLP 2004, held jointly in Potsdam, Germany in March 2004.
The 18 revised full papers presented together with an invited tutorial lecture and an invited paper were selected during two rounds of reviewing and improvement. The papers are organized in topical sections on knowledge management and decision support, constraint programming and constraint solving, and declarative programming and Web-based systems.
Author(s): Dietmar Seipel, Michael Hanus, Ulrich Geske, Oskar Bartenstein
Series: Lecture Notes in Computer Science - Lecture Notes Artificial Intelligence
Publisher: Springer
Year: 2005
Language: English
Pages: 318
front-matter......Page 1
Introduction......Page 10
XML Documents......Page 11
Validation of Documents......Page 13
Picking the Parts......Page 14
Description Logic for the Representation of DTDs......Page 15
Translation of DTDs......Page 17
Empty Result Sets......Page 18
How to Construct the Concept Expressions......Page 19
Finite Model......Page 20
Translation to Logic Programs......Page 21
Conclusion......Page 22
References......Page 23
Introduction......Page 25
Knowledge Bases in Xml......Page 27
Processing Xml Knowledge Bases with FNQUERY......Page 29
Visualization of Knowledge Bases in VISUR......Page 30
Neighbours of a Question......Page 31
Derivation Tree of a Diagnosis......Page 32
Compact Views of Knowledge Bases......Page 33
Static Analysis of the Knowledge Base......Page 35
Knowledge Bases in OWL......Page 36
References......Page 39
Introduction......Page 41
Frequent Pattern Tree and Frequent Pattern Growth Algorithm......Page 42
Construction of FP-Tree......Page 43
FP-Growth......Page 44
Construction of the FP Table......Page 45
EFP Approach......Page 47
Dataset......Page 50
Performance Comparison......Page 51
Related Work......Page 53
References......Page 54
Introduction......Page 56
Related Work......Page 59
System Architecture......Page 61
Tokenization......Page 63
Parsing......Page 66
Learning......Page 68
Transfer......Page 69
Generation......Page 70
References......Page 72
Introduction......Page 74
Diagnostic Scores Using Scoring Rules – An Overview......Page 75
Simplicity Measures......Page 77
Accuracy Measures......Page 78
A Unifying Quality Measure for Semi-automatic Learning Methods......Page 80
Basic Algorithm for Learning Diagnostic Scores......Page 81
Evaluation......Page 84
Conclusion......Page 86
References......Page 87
Introduction......Page 88
Related Work......Page 89
The Rule-Based Language......Page 90
Classification as Visualization Mapping......Page 91
Mapping Example......Page 94
Independent Variables......Page 97
Dependent Variables......Page 98
Hypotheses......Page 99
Efficiency......Page 100
Accuracy......Page 101
Satisfaction......Page 103
Conclusion and Future Work......Page 104
References......Page 105
Introduction......Page 107
Related Work......Page 108
STACLP: A Spatio-Temporal Language......Page 110
Representing Trajectories......Page 112
Spatio-Temporal Analysis in STACLP......Page 114
Deductive Analysis in STACLP......Page 115
Inductive Analysis in STACLP......Page 117
Conclusions......Page 121
References......Page 122
Introduction......Page 125
Semantic Structures......Page 127
Mining Syntactical Association Rules in Video Streams......Page 129
Extracting Topics Based on Character's Rhythm......Page 133
Syntactical Association Rules......Page 137
Topic Continuities......Page 138
Conclusion and Future Work......Page 140
References......Page 141
Introduction......Page 143
Boolean Equation Systems......Page 144
Properties of Boolean Equation Systems......Page 146
Stable Models of Normal Logic Programs......Page 149
Solving Boolean Equation Systems in ASP......Page 150
Experiments......Page 152
References......Page 155
Introduction......Page 158
Constraint Satisfaction at Glance......Page 159
A Seesaw Problem: Symmetry Breaking and Global Constraints......Page 162
An Assignment Problem: Dual Models......Page 165
A Golomb Ruler Problem: Redundant Constraints......Page 169
Conclusions......Page 171
Acknowledgements......Page 172
References......Page 173
Introduction......Page 175
Local Search in COMPOSER......Page 176
Related Work......Page 177
The Constraint Model......Page 178
Graph Structures......Page 179
Costs and Conflict Levels......Page 180
Incremental Computation......Page 182
Constraint Modeling......Page 183
The n-Queens Problem......Page 184
The Progressive Party Problem......Page 188
References......Page 192
Introduction......Page 194
The Alternative Resource Constraint Problem......Page 195
Forbidden Regions......Page 196
Global Overload Checking......Page 198
Implementation......Page 200
Empirical Examinations......Page 201
Conclusion and Future Work......Page 207
References......Page 208
Introduction......Page 209
ConBaConL......Page 210
Compositional Constraints......Page 211
Problem Solution Model......Page 212
CE Constraints......Page 213
Configuration Process......Page 215
Availability Variables......Page 217
Availability Constraints......Page 218
Example of Time-Constrained Configuration......Page 219
Conclusion......Page 221
References......Page 222
Railway Simulation......Page 224
Constraint-Based Railway Simulation......Page 225
Algorithm......Page 227
Iterations......Page 228
Realization......Page 229
Case Study......Page 231
Conclusion......Page 233
Outlook......Page 234
References......Page 235
Introduction......Page 236
Age of Wisdom......Page 237
Creating for What?......Page 238
What Does 'Concurrent' Mean ?......Page 240
DICE Is Not for New Product Development......Page 241
Concurrent Engineering: It Grew with Time......Page 242
Concurrent Engineering: Reborn as Life Cycle Engineering......Page 243
Various Types of Concurrencies......Page 244
Collaboration: How It Changed with Time......Page 245
Fixed Function and Growing Function......Page 247
Value in an Age of Wisdom......Page 249
From Product to Wisdom Development......Page 250
Communication......Page 251
Summary......Page 252
References......Page 253
Motivation and Overview......Page 254
Extending Swi--Prolog with Foreign Libraries......Page 256
The x2p Package......Page 257
The API of x2p......Page 258
Field Notation and FnPath......Page 259
Web Services......Page 260
SOAP, WSDL, and UDDI......Page 261
gSOAP......Page 262
Putting It All Together......Page 263
Applications......Page 264
Summary and Outlook......Page 265
References......Page 266
Differences to Traditional Logic Programming......Page 267
Partial Patterns and Grouping Constructs......Page 268
Simulation Unification......Page 269
Decomposition Rules......Page 271
Common Properties......Page 273
One at Once......Page 274
All at Once......Page 275
Related Work and Conclusion......Page 276
References......Page 277
Overview......Page 278
Dialog Model......Page 280
Presentation......Page 281
Animation......Page 282
Implementation......Page 283
Technology......Page 284
Applications......Page 285
References......Page 286
Introduction......Page 287
Spatial Programming......Page 288
Model of Place-Dependent Processing......Page 290
Description of Object and Junction......Page 291
Description of Object......Page 292
Description of Junction......Page 293
Interaction Process Between Object and Junction......Page 295
Construction of VR Space......Page 296
Spatial Programming Environment with VR......Page 300
Conclusions......Page 301
WebAssign and AT(x)......Page 303
An Example Session......Page 305
Function and Implementation of the Interface Component......Page 306
Global Security Issues......Page 307
Requirements for the Analysis Components......Page 308
Analysis of Prolog Programs......Page 309
Examples: Partial Specifications of Program Properties......Page 312
Related Work......Page 315
References......Page 316
back-matter......Page 318
