default search action
26. KI 2003: Hamburg, Germany
- Andreas Günter, Rudolf Kruse, Bernd Neumann:
KI 2003: Advances in Artificial Intelligence, 26th Annual German Conference on AI, KI 2003, Hamburg, Germany, September 15-18, 2003, Proceedings. Lecture Notes in Computer Science 2821, Springer 2003, ISBN 3-540-20059-2
Invited Papers
- Wolfgang Wahlster:
Towards Symmetric Multimodality: Fusion and Fission of Speech, Gesture, and Facial Expression. 1-18 - Siegfried Handschuh, Steffen Staab, Rudi Studer:
Leveraging Metadata Creation for the Semantic Web with CREAM. 19-33 - Nicholas R. Jennings:
Negotiation Technologies. 34-36 - Daniel A. Keim, Christian Panse, Jörn Schneidewind, Mike Sips, Ming C. Hao, Umeshwar Dayal:
Pushing the Limit in Visual Data Exploration: Techniques and Applications. 37-51 - Erik Sandewall, Patrick Doherty, Oliver Lemon, Stanley Peters:
Words at the Right Time: Real-Time Dialogues with the WITAS Unmanned Aerial Vehicle: Extended Abstract. 52-63
Logics and Ontologies
- Franz Baader:
The Instance Problem and the Most Specific Concept in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics. 64-78 - M. Lange:
Satisfiability and Completeness of Converse-PDL Replayed. 79-92 - Philippe Besnard, Robert E. Mercer, Torsten Schaub:
Optimality Theory through Default Logic. 93-104 - Pascal Hitzler:
Towards a Systematic Account of Different Logic Programming Semantics. 105-119 - Luc Schneider:
How to Build a Foundational Ontology: The Object-Centered High-level Reference Ontology OCHRE. 120-134 - Anand Kumar, Barry Smith:
The Universal Medical Language System and the Gene Ontology: Some Critical Reflections. 135-148
Cognitive Modeling
- Michael Arens, Hans-Hellmut Nagel:
Behavioral Knowledge Representation for the Understanding and Creation of Video Sequences. 149-163 - Joscha Bach, Ronnie Vuine:
Designing Agents with MicroPsi Node Nets. 164-178 - Pierre E. Bonzon:
Conscious Behavior through Reflexive Dialogs. 179-193
Reasoning Methods
- Gero Iwan, Gerhard Lakemeyer:
What Observations Really Tell Us. 194-208 - Ozan Kahramanogullari, Michael Thielscher:
A Formal Assessment Result for Fluent Calculus Using the Action Description Language Ak. 209-223 - Pietro Torasso, Gianluca Torta:
Computing Minimum-Cardinality Diagnoses Using OBDDs. 224-238 - Helmut Horacek:
Presenting Sets of Problem Solutions Concisely. 239-253
Machine Learning
- Benno Stein, Sven Meyer zu Eissen:
Automatic Document Categorization: Interpreting the Perfomance of Clustering Algorithms. 254-266 - Rainer Osswald, Wiebke Petersen:
A Logical Approach to Data-Driven Classification. 267-281 - Carsten Gips, Fritz Wysotzki:
Spatial Inference - Combining Learning and Constraint Solving. 282-296 - Cláudio Adriano Policastro, André Carlos Ponce de Leon Ferreira de Carvalho, Alexandre C. B. Delbem:
Hybrid Approaches for Case Retrieval and Adaptation. 297-311
Neural Networks
- Stefan Bischoff, D. Reuss, Fritz Wysotzki:
Applied Connectionistic Methods in Computer Vision to Compare Segmented Images. 312-326 - Olga Valenzuela, Ignacio Rojas, Fernando Rojas:
Sequential Learning Algorithm of Neural Networks Systems for Time Series. 327-341 - Brijnesh J. Jain, Fritz Wysotzki:
A k-Winner-Takes-All Classifier for Structured Data. 342-354 - Pascal Hitzler, Anthony Karel Seda:
Continuity of Semantic Operators in Logic Programming and Their Approximation by Artificial Neural Networks. 355-369
Reasoning under Uncertainty
- Vagan Y. Terziyan, Oleksandra Vitko:
Bayesian Metanetworks for Modelling User Preferences in Mobile Environment. 370-384 - Christian Borgelt:
On Identifying Tree-Structured Perfect Maps. 385-395 - Marcus Hutter, Marco Zaffalon:
Bayesian Treatment of Incomplete Discrete Data Applied to Mutual Information and Feature Selection. 396-406 - Gabriele Kern-Isberner, Wilhelm Rödder:
Fusing Probabilistic Information on Maximum Entropy. 407-420 - Alvaro Soto, Pradeep K. Khosla:
A Probabilistic Approach for Dynamic State Estimation Using Visual Information. 421-435 - Aljoscha Klose:
Approaches to Semi-supervised Learning of Fuzzy Classifiers. 436-449 - Eyke Hüllermeier:
Instance-Based Learning of Credible Label Sets. 450-464 - Wilhelm Rödder, Gabriele Kern-Isberner:
Self Learning or How to Make a Knowledge Base Curious about Itself. 465-474 - Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas:
Tolerance Spaces and Approximative Representational Structures. 475-489
Planning And Constraints
- Jürgen Dix, Ugur Kuter, Dana S. Nau:
Planning in Answer Set Programming Using Ordered Task Decomposition. 490-504 - Chunping Li:
The Process Semantics Based Reasoning about Continuous Change. 505-519 - Stephan Frank, Petra Hofstedt, Pierre R. Mai:
A Flexible Meta-solver Framework for Constraint Solver Collaboration. 520-534
Spatial Modeling
- Björn Gottfried:
Tripartite Line Tracks - Bipartite Line Tracks. 535-549 - Andreas Nüchter, Hartmut Surmann, Kai Lingemann, Joachim Hertzberg:
Consistent 3D Model Construction with Autonomous Mobile Robots. 550-564 - Mehmet Giritli:
Who Can Connect in RCC? 565-579 - Marco Ragni:
An Arrangement Calculus, Its Complexity and Algorithmic Properties. 580-590
User Modeling
- Johann Adelhardt, Rui Ping Shi, Carmen Frank, Viktor Zeißler, Anton Batliner, Elmar Nöth, Heinrich Niemann:
Multimodal User State Recognition in a Modern Dialogue System. 591-605 - Detlef Küpper, Alfred Kobsa:
Tailoring the Presentation of Plans to Users' Knowledge and Capabilites. 606-617
Agent Technology
- Silke Höppner:
An Agents' Definition Framework and a Methodology for Deriving Agents' Taxonomies. 618-632 - Jochen Müller, Peter Poller, Valentin Tschernomas:
A Multimodal Fission Approach with a Presentation Agent in the Dialog System SmartKom. 633-645 - Jürgen Dix, Thomas Eiter, Michael Fink, Axel Polleres, Yingqian Zhang:
Monitoring Agents Using Declarative Planning. 646-660
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.