Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar16. IJCAI 1999: Stockholm, Sweden
Thomas Dean:
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31 - August 6, 1999. 2 Volumes, 1450 pages. Morgan Kaufmann 1999, ISBN 1-55860-613-0
VOLUME 1
Automated Reasoning
Theorem Proving
Marc Fuchs:
Lemma Generation for Model Elimination by Combining Top-Down and Bottom-Up Inference. 4-9Jörg Denzinger, Dirk Fuchs:
Cooperation of Heterogeneous Provers . 10-15Dieter Fensel, V. Richard Benjamins, Enrico Motta, Bob J. Wielinga:
UPML: A Framework for Knowledge System Reuse. 16-23
Nonmonotonic Reasoning 1
Sylvie Coste-Marquis, Pierre Marquis:
Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases. 24-29Alexander Bochman:
Credulous Nonmonotonic Inference. 30-35Yannis Dimopoulos, Bernhard Nebel, Francesca Toni:
Preferred Arguments are Harder to Compute than Stable Extension. 36-43
Nonmonotonic Reasoning 2
Katsumi Inoue, Chiaki Sakama:
Abducing Priorities to Derive Intended Conclusions. 44-49Rachel A. Bourne, Simon Parsons:
Maximum Entropy and Variable Strength Defaults. 50-55Pierre Hansen, Brigitte Jaumard, A. D. Parreira:
On the Relations between Probabilistic Logic and p-CMS. 56-63
Nonmonotonic Reasoning 3: Model Checking Methods
Robert Baumgartner, Georg Gottlob:
On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases. 64-69Christoph Koch, Nicola Leone:
Stable Model Checking Made Easy. 70-75Riccardo Rosati:
Model Checking for Nonmonotonic Logics: Algorithms and Complexity. 76-83
Description Logics 1
Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini:
Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees. 84-89Carsten Lutz:
Reasoning with Concrete Domains. 90-95Franz Baader, Ralf Küsters, Ralf Molitor:
Computing Least Common Subsumers in Description Logics with Existential Restrictions. 96-103
Description Logics 2
Frank Wolter, Michael Zakharyaschev:
Multi-Dimensional Description Logics. 104-109Ullrich Hustadt, Renate A. Schmidt:
On the Relation of Resolution and Tableaux Proof Systems for Description Logics. 110-117
Semantics and Models
Pavlos Peppas, Maurice Pagnucco, Mikhail Prokopenko, Norman Y. Foo, Abhaya C. Nayak:
Preferential Semantics for Causal Systems. 118-123Gerhard Lakemeyer, Hector J. Levesque:
Query Evaluation and Progression in AOL Knowledge Bases. 124-131Adriana Zapico:
Axiomatic Foundations for Qualitative/Ordinal Decisions with Partial Preferences. 132-139
Reasoning about Action 1
Murray Shanahan:
The Ramification Problem in the Event Calculus. 140-146Eyal Amir, Pedrito Maynard-Reid II:
Logic-Based Subsumption Architecture. 147-152Eugenia Ternovskaia:
Automata Theory for Reasoning About Actions. 153-159
Reasoning about Action 2
Giuseppe De Giacomo, Hector J. Levesque:
Projection Using Regression and Sensors. 160-165Thomas Drakengren, Marcus Bjäreland:
Expressive Reasoning about Action in Nondeterministic Polynomial Time. 166-171Xiaoping Chen, Guiquan Liu:
A Logic of Intention. 172-179
Belief Revision
James P. Delgrande:
Considerations on a Similarity-Based Approach to Beleif Change. 180-185Gabriele Kern-Isberner:
Postulates for Conditional Belief Revision. 186-191Samir Chopra, Rohit Parikh:
An Inconsistency Tolerant Model for Belief Representation and Belief Revision. 192-199
Resource-Bounded Reasoning
Michael Fisher, Chiara Ghidini:
Programming Resource-Bounded Deliberative Agents. 200-205Michel Lemaître, Gérard Verfaillie, Nicolas Bataille:
Exploiting a Common Property Resource under a Fairness Constraint: a Case Study. 206-211Arnaud Delhay, Max Dauchet, Patrick Taillibert, Philippe Vanheeghe:
Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval. 212-221
Case-Based Reasoning
Case-Based Reasoning 1
David McSherry:
Demand-Driven Discovery of Adaptation Knowledge. 222-227Zhong Zhang, Qiang Yang:
Dynamic Refinement of Feature Weights Using Quantitative Introspective Learning. 228-233Jun Zhu, Qiang Yang:
Remembering to Add: Competence-preserving Case-Addition Policies for Case Base Maintenance. 234-241
Case-Based Reasoning 2
Andres F. Rodriguez, Sunil Vadera:
PEBM: A Probabilistic Exemplar Based Model. 242-247Eyke Hüllermeier:
Toward a Probabilistic Formalization of Case-Based Inference. 248-253Hui Wang, Werner Dubitzky, Ivo Düntsch, David A. Bell:
A Lattice Machine Approach to Automated Casebase Design: Marrying Lazy and Eager Learning. 254-263
Challenge Papers
Challenge Papers 1
Mike Perkowitz, Oren Etzioni:
Adaptive Web Sites: Conceptual Cluster Mining. 264-269Ashwin Srinivasan, Ross D. King, Douglas W. Bristol:
An assessment of submissions made to the Predictive Toxicology Evaluation Challenge. 270-275Milind Tambe, Gal A. Kaminka, Stacy Marsella, Ion Muslea, Taylor Raines:
Two Fielded Teams and Two Experts: A RoboCup Challenge Response from the Trenches. 276-283
Challenge Papers 2: Propositional Reasoning and Search
Adnan Darwiche:
Compiling Knowledge into Decomposable Negation Normal Form. 284-289Fabio Massacci:
Using Walk-SAT and Rel-Sat for Cryptographic Key Search. 290-295Holger H. Hoos:
SAT-Encodings, Search Space Structure, and Local Search Performance. 296-303
Challenge Papers 3: Propositional Reasoning and Search / Planning
Thomas Vossen, Michael O. Ball, Amnon Lotem, Dana S. Nau:
On the Use of Integer Programming Models in AI Planning. 304-309Steven A. Wolfman, Daniel S. Weld:
The LPSAT Engine & Its Application to Resource Planning. 310-317
Challenge Papers 4: Bridging Plan Synthesis Paradigms
Henry A. Kautz, Bart Selman:
Unifying SAT-based and Graph-based Planning. 318-325David E. Smith, Daniel S. Weld:
Temporal Planning with Mutual Exclusion Reasoning. 326-337
Cognitive Modeling
Cognitive Modeling 1
Elisabeth Le Saux, Philippe Lenca, Philippe Picouet, Jean-Pierre Barthélemy:
An Anthropocentric Tool for Decision Making Support. 338-343Edwin D. de Jong:
Autonomous Concept Formation. 344-349Srinivas Narayanan:
Reasoning About Actions in Narrative Understanding. 350-357
Cognitive Modeling 2
Armin Fiedler:
Using a Cognitive Architecture to Plan Dialogs for the Adaptive Explanation of Proofs. 358-363Bart G. de Boer:
Investigating the Emergence of Speech Sounds. 364-369Filippo Neri:
Computer Aided Tracing of Children?s Physics Learning: a Teacher Oriented View. 370-377
Cognitive Modeling 3: Spatial Reasoning
Norman Y. Foo, Maurice Pagnucco, Abhaya C. Nayak:
Diagrammatic Proofs. 378-383Christian Kray, Anselm Blocher:
Modeling the Basic Meanings of Path Relations. 384-393
Constraint Satisfaction
Constraint Satisfaction 1
Georg Gottlob, Nicola Leone, Francesco Scarcello:
A Comparison of Structural CSP Decomposition Methods. 394-399Pedro Meseguer, Carme Torras:
Solving Strategies for Highly Symmetric CSPs. 400-405Hélène Collavizza, François Delobel, Michel Rueher:
Extending Consistent Domains of Numeric CSP. 406-413
Constraint Satisfaction 2
Kostas Stergiou, Toby Walsh:
The Difference All-Difference Makes. 414-419Jean-Charles Régin:
The Symmetric Alldiff Constraint. 420-425Kalev Kask, Rina Dechter:
Branch and Bound with Mini-Bucket Heuristics. 426-435
Constraint Satisfaction 3
Nikos Mamoulis, Dimitris Papadias:
Improving Search Using Indexing: A Study with Temporal CSPs. 436-441Philippe Balbiani, Jean-François Condotta, Luis Fariñas del Cerro:
A New Tractable Subclass of the Rectangle Algebra. 442-447Jochen Renz:
Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis. 448-455
Constraint Satisfaction 4
Christian Bliek, Djamila Sam-Haroud:
Path Consistency on Triangulated Constraint Graphs. 456-461Jörg Hoffmann, Jana Koehler:
A New Method to Index and Query Sets. 462-467Evelina Lamma, Paola Mello, Michela Milano, Rita Cucchiara, Marco Gavanelli, Massimo Piccardi:
Constraint Propagation and Value Acquisition: Why we should do it Interactively. 468-477
Distributed AI
Multi-Agent Systems 1
Craig Boutilier:
Sequential Optimality and Coordination in Multiagent Systems. 478-485Jeremy Pitt, E. H. Mamdani:
A Protocol-Based Semantics for an Agent Communication Language. 486-491Sanguk Noh, Piotr J. Gmytrasiewicz:
Towards Flexible Multi-Agent Decision-Making Under Time Pressure. 492-499
Multi-Agent Systems 2
Shih-Hung Wu, Von-Wun Soo:
Risk Control in Multi-agent Coordination by Negotiation with a Trusted Third Party. 500-505Amy Greenwald, Jeffrey O. Kephart:
Shopbots and Pricebots. 506-511Sudhir K. Rustogi, Munindar P. Singh:
Be Patient and Tolerate Imprecision: How Autonomous Agents can Coordinate Effectively. 512-519
Economic Models 1
William E. Walsh, Michael P. Wellman:
Efficiency and Equilibrium in Task Allocation Economies with Hierarchical Dependencies. 520-526Craig Boutilier, Moisés Goldszmidt, Bikash Sabata:
Sequential Auctions for the Allocation of Resources with Complementarities. 527-523Tuomas Sandholm, Sandeep Sikka, Samphel Norden:
Algorithms for Optimizing Leveled Commitment Contracts. 535-541
Economic Models 2: Auctions
Tuomas Sandholm:
An Algorithm for Optimal Winner Determination in Combinatorial Auctions. 542-547Yuzo Fujishima, Kevin Leyton-Brown, Yoav Shoham:
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches. 548-553Yuzo Fujishima, David McAdams, Yoav Shoham:
Speeding Up Ascending-Bid Auctions. 554-563
Computer Game Playing
Game Playing 1
Donald F. Beal, Martin C. Smith:
Temporal Coherence and Prediction Decay in TD Learning. 564-569Andreas Junghanns, Jonathan Schaeffer:
Domain-Dependent Single-Agent Search Enhancements. 570-577
Game Playing 2
Martin Müller:
Decomposition Search: A Combinatorial Games Approach to Game Tree Search, with Applications to Solving Go Endgames. 578-583Matthew L. Ginsberg:
GIB: Steps Toward an Expert-Level Bridge-Playing Program. 584-593
Knowledge-Based Applications
Applications 1
Andrew Lim:
An Effective Ship Berthing Algorithm. 594-599Ian D. Watson, Dan Gardingen:
A Distributed Case-Based Reasoning Application for Engineering Sales Support. 600-605Liviu Badea:
Knowledge Modeling and Reusability in ExClaim. 606-613
Applications 2
Mary F. Fernández, Daniela Florescu, Alon Y. Levy, Dan Suciu:
Verifying Integrity Constraints on Web Sites. 614-619Christophe Dousson, Thang Vu Duong:
Discovering Chronicles with Numerical Time Constraints from Alarm Logs for Monitoring Dynamic Systems. 620-626James S. Aitken, Dimitrios Sklavakis:
Integrating Problem-Solving Methods into CYC. 627-633
Applications 3
Michelle X. Zhou:
Visual Planning: A Practical Approach to Automated Presentation Design. 634-641Taizan Suzuki, Takenobu Tokunaga, Hozumi Tanaka:
A Case Based Approach to the Generation of Musical Expression. 642-648Renaud Lecoeuche, Catherine Barry, David Stuart Robertson:
Using Focus Rules in Requirements Elicitation Dialogues. 649-654
VOLUME 2
Machine Learning
Learning for Information Retrieval 1
Andrew McCallum, Kamal Nigam, Jason Rennie, Kristie Seymore:
A Machine Learning Approach to Building Domain-Specific Search Engines. 662-667Eibe Frank, Gordon W. Paynter, Ian H. Witten, Carl Gutwin, Craig G. Nevill-Manning:
Domain-Specific Keyphrase Extraction. 668-673Georgios Paliouras, Vangelis Karkaletsis, Constantine D. Spyropoulos:
Learning Rules for Large Vocabulary Word Sense Disambiguation. 674-681
Learning for Information Retrieval 2
Thomas Hofmann:
The Cluster-Abstraction Model: Unsupervised Learning of Topic Hierarchies from Text Data. 682-687Thomas Hofmann, Jan Puzicha:
Latent Class Models for Collaborative Filtering. 688-693Anne Veling, Peter van der Weerd:
Conceptual Grouping in Word Co-Occurrence Networks. 694-701
Classification Learning 1
Geoffrey I. Webb:
Decision Tree Grafting From the All Tests But One Partition. 702-707Michèle Sebag:
Constructive Induction: A Version Space-based Approach. 708-713Pedro M. Domingos:
Process-Oriented Estimation of Generalization Error. 714-721
Classification Learning 2: Support Vector Machines
Craig Saunders, Alexander Gammerman, Volodya Vovk:
Transduction with Confidence and Credibility. 722-726Jason Weston:
Leave-One-Out Support Vector Machines. 727-733
Reinforcement Learning 1
Ronen I. Brafman, Moshe Tennenholtz:
A Near-Optimal Poly-Time Algorithm for Learning a class of Stochastic Games. 734-739Michael J. Kearns, Daphne Koller:
Efficient Reinforcement Learning in Factored MDPs. 740-747Vassilis A. Papavassiliou, Stuart J. Russell:
Convergence of Reinforcement Learning with General Function Approximators. 748-757
Reinforcement Learning 2: Applications
Shailesh Kumar, Risto Miikkulainen:
Confidence Based Dual Reinforcement Q-Routing: An adaptive online network routing algorithm. 758-763Simone C. Riedmiller, Martin A. Riedmiller:
A Neural Reinforcement Learning Approach to Learn Local Dispatching Policies in Production Scheduling. 764-771
Automated Discovery
Takashi Washio, Hiroshi Motoda, Yuji Niwa:
Discovering Admissible Model Equations from Observed Data Based on Scale-Types and Identity Constrains. 772-779Gilles Caporossi, Pierre Hansen:
Finding Relations in Polynomial Time. 780-785Simon Colton, Alan Bundy, Toby Walsh:
Automatic Concept Formation in Pure Mathematics. 786-793
Data Mining
Tim Oates, Matthew D. Schmill, Paul R. Cohen:
Efficient Mining of Statistical Dependencies. 794-799Rachel Ben-Eliyahu-Zohary, Ehud Gudes:
Towards Efficient Metaquerying. 800-805Hung Son Nguyen:
Efficient SQL-Querying Method for Data Mining in Large Data Bases. 806-813
Neural Networks 1
Lotfi Ben Romdhane:
A Potts Spin MFT Network Solving Multiple Causal Interactions. 814-819Marshall R. Mayberry, Risto Miikkulainen:
SARDSRN: A Neural Network Shift-Reduce Parser. 820-827
Neural Networks 2
Odin Taylor, John MacIntyre, John Tait:
Improved Classification for a Data Fusing Kohonen Self Organizing Map Using A Dynamic Thresholding Technique. 828-832Nigel P. Duffy, Arun K. Jagota:
Generalized Connectionist Associative Memory. 833-839
Hybrid systems: Neural and Symbolic Processing
Stefan Wermter:
Preference Moore Machines for Neural Fuzzy Integration. 840-845Alexander A. Petrov, Boicho N. Kokinov:
Processing Symbols at Variable Speed in DUAL: Connectionist Activation as Power Supply. 846-851João Luís Garcia Rosa, Edson Françozo:
Hybrid Thematic Role Processor: Symbolic Linguistic Relations Revised by Connectionist Learning. 852-861
Natural Language Processing
Natural Language Processing 1
Luc Steels, Frédéric Kaplan:
Situated Grounded Word Semantics. 862-867Martin Romacker, Udo Hahn, Katja Markert:
Lean Semantic Interpretation. 868-875Chris Reed:
The Role of Saliency in Generating Natural Language Arguments. 876-883
Natural Language Processing 2
Mark Stevenson, Yorick Wilks:
Combining Weak Knowledge Sources for Sense Disambiguation. 884-889Fabio Ciravegna, Alberto Lavelli, Luca Gilardoni, Johannes Matiasek, Nadia Mana, Silvia Mazza, Massimo Ferraro, William J. Black, Fabio Rinaldi, David Mowatt:
FACILE: Classifying Texts Integrating Pattern Matching and Information Extraction. 890-897
Natural Language Processing 3: Learning
Dan Roth:
Learning in Natural Language. 898-904Bhavani Raskutti, Christopher Leckie:
An Evaluation of Criteria for Measuring the Quality of Clusters. 905-910Roni Khardon, Dan Roth, Leslie G. Valiant:
Relational Learning for NLP using Linear Threshold Elements. 911-919
Natural Language Processing 4: Information Retrieval
Rila Mandala, Takenobu Tokunaga, Hozumi Tanaka:
Combining General Hand-Made and Automatically Constructed Thesauri for Query Expansion in Information Retrieval. 920-925Hidetsugu Nanba, Manabu Okumura:
Towards Multi-paper Summarization Using Reference Information. 926-931Peter M. Wiemer-Hastings:
How Latent is Latent Semantic Analysis? 932-941
Planning and Scheduling
Planning 1
Patrick Fabiani, Jean-Claude Latombe:
Dealing with Geometric Constraints in Game-Theoretic Planning. 942-947Chitta Baral, Vladik Kreinovich, Raul Trejo:
Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness. 948-955
Planning 2: Exploiting Domain Structure
Maria Fox, Derek Long:
The Detection and Exploitation of Symmetry in Planning Problems. 956-961Mathias Bauer:
From Interaction Data to Plan Libraries: A Clustering Approach. 962-967Dana S. Nau, Yue Cao, Amnon Lotem, Héctor Muñoz-Avila:
SHOP: Simple Hierarchical Ordered Planner. 968-975
Planning 3: Disjunctive Planning
Ronen I. Brafman:
Reachability, Relevance, Resolution and the Planning as Satisfiability Approach. 976-981Subbarao Kambhampati:
Improving Graphplan's Search with EBL & DDB Techniques. 982-987Ronen I. Brafman, Holger H. Hoos:
To Encode or Not to Encode - Linear Planning. 988-995