KR'92 - CALL FOR PAPERS and CONFERENCE PROGRAM THIRD INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING Royal Sonesta Hotel, Cambridge, Massachusetts, USA with support from AAAI, ECCAI, and CSCSI in cooperation with IJCAII October 26-29, 1992 (KR'92 follows the AAAI Fall Symposium Series at the same location October 23-25) The idea of explicit representations of knowledge manipulated by inference algorithms provides an important foundation for much work in Artificial Intelligence, from natural language to expert systems. A growing number of researchers are interested in the principles governing systems based on this idea. This conference will bring together these researchers in a more intimate setting than that of the general AI conferences. In particular, authors will have the opportunity to give presentations of adequate length to present substantial results. The theme of this year's conference is the relationship between the principles of knowledge representation and reasoning and their embodiment in working systems. Authors are encouraged to relate their work to one of the following important questions: (1) What issues arise in applying knowledge representation systems to real problems, and how can they be addressed? (2) What are the theoretical principles in knowledge representation and reasoning? (3) How can these principles be embodied in knowledge representation systems? Submissions are encouraged in (but are not limited to) the following topic areas: KNOWLEDGE REPRESENTATION FORMALISMS REASONING METHODS - logics of knowledge and belief - deduction - nonmonotonic logics - abduction - temporal logics - induction - spatial logics - learning - taxonomic logics - planning and plan analysis - logics of uncertainty - constraint solving and evidence - diagnosis - classification - inheritance - belief management and revision - analogical reasoning GENERIC ONTOLOGIES FOR DESCRIBING ISSUES IN IMPLEMENTED KR&R SYSTEMS - time - comparative evaluation - space - empirical results - causality - benchmarking and testing - resources - reasoning architectures - constraints - efficiency/completeness tradeoffs - applications classes - complexity such as medicine - algorithms SUBMISSION OF PAPERS The Program Committee will review EXTENDED ABSTRACTS rather than complete papers. Abstracts must be at most twelve (12) pages with a maximum of 38 lines per page and an average of 75 characters per line (corresponding to the LaTeX article-style, 12pt), excluding the title page and the bibliography. Overlength submissions will be returned. All abstracts must be submitted on 8 1/2" x 11" or A4 paper, and printed or typed in 12-point font (10 characters/inch on a typewriter). Dot matrix printout, FAX, or electronic submission will not be accepted. Each submission should include the names and complete addresses of all authors. Correspondence will be sent to the first author, unless otherwise indicated. Also, authors should indicate under the title which of the questions and/or topic areas listed above best describes their paper (if none is appropriate, please give a set of keywords that best describe the topic of the paper). Five (5) copies of the abstract must be received by one of the program co-chairs no later than April 21, 1992. Papers received after that date will be returned unopened. Authors will be notified of the Program Committee's decision by June 15, 1992. REVIEW OF PAPERS Submissions will be judged on clarity, significance, and originality. An important criterion for acceptance is that the paper clearly contributes to principles of representation and reasoning that are likely to influence current and future AI practice. Extended abstracts should contain enough information to enable the Program Committee to identify and evaluate the principal contribution of the research and its importance. It should also be clear from the extended abstract how the work compares to related work in the field. Submitted papers must be unpublished. Submissions must also be substantively different from papers currently under review and must not be submitted elsewhere before the author notification date (June 15, 1992). FINAL PAPERS Authors of accepted papers will be expected to submit substantially longer full papers for the conference proceedings. Final camera-ready copies of the full papers will be due August 3, 1992. Final papers will be allowed at most twelve (12) double-column pages in the conference proceedings (corresponding to approx. 28 article-style LaTeX pages; a style file will be provided by the publisher). CONFERENCE CHAIR Charles Rich Mitsubishi Electric Research Laboratories 201 Broadway Cambridge, MA 02139, USA Voice: +1 (617) 621-7507 Fax: +1 (617) 621-7550 Email: rich@merl.com PROGRAM CO-CHAIRS Bernhard Nebel William Swartout DFKI USC/Information Sciences Institute Stuhlsatzenhausweg 3 4676 Admiralty Way D-W-6600 Saarbrucken Marina del Rey, CA 90292-6695 Germany USA Voice: +49 (681) 302-5254 Voice: +1 (213) 822-1511 Fax: +49 (681) 302-5341 Fax: +1 (213) 823-6714 Email: nebel@dfki.uni-sb.de Email: swartout@isi.edu LOCAL ARRANGEMENT CHAIR James Schmolze Dept.of Computer Science Tufts University Medford, MA 02155 USA Voice: +1 (617) 627-3681 Fax: +1 (617) 627-3443 Email: schmolze@cs.tufts.edu PROGRAM COMMITTEE James Allen (Univ of Rochester), Guiseppe Attardi (Univ of Pisa), Daniel Bobrow (Xerox PARC), Ron Brachman (AT&T Bell Labs), Gerd Brewka (GMD, Bonn), Rina Dechter (UC Irvine), Johan de Kleer (Xerox PARC), Jon Doyle (MIT), David Etherington (AT&T Bell Labs), Richard Fikes (Stanford Univ), Alan Frisch (Univ of Illinois), Dov Gabbay (Imperial College), Michael Georgeff (AAII), Pat Hayes (Stanford Univ), Maurizio Lenzerini (Univ of Roma), Robert MacGregor (USC/ISI), Alan Mackworth (UBC), David Makinson (Paris), David McAllester (MIT), Fumio Mizoguchi (Science Univ of Tokyo), Wolfgang Nejdl (TU Vienna), Hans-Juergen Ohlbach (MPI, Saarbruecken), Peter Patel-Schneider (AT&T Bell Labs), Ramesh Patil (USC/ISI), Judea Pearl (UCLA), Martha Pollack (Univ of Pittsburgh), Henri Prade (Univ Paul Sabatier), Erik Sandewall (Univ of Linkoeping), Len Schubert (Univ of Rochester), Stu Shapiro (SUNY Buffalo), Gert Smolka (Univ of Saarland, DFKI Saarbruecken), Peter Szolovits (MIT), Mike Wellman (USAF Wright Lab) IMPORTANT DATES Submission receipt deadline: April 21, 1992 Author notification date: June 15, 1992 Camera-ready copy due to publisher: August 3, 1992 Conference: October 26-29, 1992 PROGRAM, BALLROOM A Monday, October 26 Sunday: Reception, 7:00-9:00 p.m. 8:30 Invited Talks: Reports from the Trenches Peter Szolovits, Martha E. Pollack (Abstracts above) 9:50 Break Planning and Temporal Reasoning I: Constraint-Based 10:20 Declarative Knowledge Representation in Planning and Scheduling Jacek Gibert-U.Melbourne, Australia 10:55 Intelligent Backtracking Techniques for Job Shop Scheduling Yalin Xiong, Norman Sadeh and Katia Sycara-Carnegie Mellon U.,USA 11:30 Dense Time and Temporal Constraints with "not equals" Manolis Koubarakis-National Technical U. Athens, Greece 12:05 Lunch Planning and Temporal Reasoning II 1:50 Managing Disjunction for Practical Temporal Reasoning Mark Boddy, Jim Carciofini and Bob Schrag-Honeywell Systems and Research Ctr.,USA 2:25 Infinite Loops in Finite Time Ernest Davis-Courant Inst.,USA 3:00 Reasoning about Indefinite Actions L.Thorne McCarty and Ron van der Meyden-Rutgers U.,USA 3:35 Break Planning and Temporal Reasoning III 4:05 Representations for Decision-Theoretic Planning: Utility Functions for Deadline Goals Peter Haddawy-U.Wisconsin,USA Steve Hanks-U.Washington,USA 4:40 Total Order vs. Partial Order Planning: Factors Influencing Performance Steven Minton, Mark Drummond, John Bresina and Andrew Philips- NASA Ames Research Ctr.,USA 5:15 A Reactive Planner that Uses Explanation Closure Andrew R. Haas-U.Albany,USA ____________________________________________________________ Tuesday, October 27 Planning and Temporal Reasoning IV 8:30 UCPOP: A Sound, Complete, Partial Order Planning for ADL J.Scott Penberthy-IBM Watson Research Ctr.,USA Daniel S.Weld-U.Washington,USA 9:05 An Approach to Planning with Incomplete Information Oren Etzioni, Steve Hanks, Daniel Weld, Denise Draper, Neal Lesh, and Mike Williamson-U.Washington,USA 9:40 Equivalence and Tractability Results for SAS+ Planning Christer Backstrom-Likoping U.,Sweden 10:15 Break Specialized Reasoning I: Numerical 10:45 Stepwise-Decomposable Influence Diagrams Lianwen Zhang and David Poole-U.British Columbia,Canada 11:20 A Logic for Approximate Reasoning Daphne Koller-Stanford U.,USA Joseph Y.Halpern-IBM Almaden Research Ctr.,USA 11:55 Lunch 1:40 Panel: The DARPA Knowledge Sharing Effort: Progress Report Ramesh Patil (Abstract above) 3:25 Break Specialized Reasoning II: Spatial/Physical 3:55 A Spatial Logic Based on Regions and Connection D.A.Randell, Z.Cui, A.G. Cohn-U.Leeds,UK 4:30 Axiomatizing Qualitative Process Theory Ernest Davis-Courant Inst.,USA 6:00 Banquet: Buses depart from main entrance of Sonesta ____________________________________________________________ Wednesday, October 28 Issues in Multi-Agent Environments 8:30 Semantics for Knowledge and Communication Adam J.Grove-Stanford U.,USA 9:05 Emergent Conventions in Multi-Agent Systems: Initial Experimental Results and Observations Yoav Shoham and Moshe Tenneholtz-Stanford U.,USA 9:40 Knowledge Representation Requirements for Description-Based Communication Anthony S.Maida-U.Southwestern Louisiana,USA 10:15 Break Specialized Reasoning III 10:45 Reasoning with Analogical Representations Karen L.Myers and Kurt Konolige-SRI International,USA 11:20 Order of Magnitude Reasoning using Logarithms P.Pandurang Nayak-Stanford U.,USA 11:55 Lunch Taxonomic Logics I: Implemented Systems 1:40 "Reducing" CLASSIC to Practice: Knowledge Representation Theory Meets Reality Ronald J.Brachman-AT&T Bell Laboratories,USA 2:15 Towards the Systematic Development of Terminological Reasoners: CLASP Reconstructed Alex Borgida-Rutgers U.,USA 2:50 An Empirical Analysis of Optimization Techniques for Terminological Representation Systems Franz Baader, Bernhard Hollunder, Bernhard Nebel, Hans-Jurgen Profitlich-German Research Ctr. for Artificial Intelligence 3:25 Break Natural Language Processing 3:55 A General Semantic Model of Negation in Natural Language: Representation and Inference Lucja Iwanska-GE Research and Development Ctr.,USA 4:30 Conversational Events and Information State Change Massimo Poesio-U.Rochester,USA 5:40 Break 8:00 Invited Talk: Resolving the Imagery Debate: A Cognitive Neuroscience Perspective, Stephen M. Kosslyn (Abstract above) _____________________________________________________________ Thursday, October 29 Taxonomic Logics II: Time and Defaults 8:30 Terminological Reasoning with Constraint Networks and an Application to Plan Recognition Roberta Weida and Diane Litman-Columbia U.,USA 9:05 A Preference Semantics for Defaults in Terminological Logics J.Joachim Quantz-Technical U. Berlin, Germany Veronique Royer-Onera-Cert,France 9:40 Embedding Defaults into Terminological Knowledge Representation Formalisms Franz Baader, Bernhard Hollunder-German Research Ctr.for Artificial Intelligence 10:15 Break Taxonomic Logics III: Expressiveness/Efficiency 10:45 Specifying Role Interaction in Concept Languages Philipp Hanschke-German Research Ctr. for Artificial Intelligence 11:20 Approximation in Concept Description Languages Marco Cadoli, Marco Schaerf-U.Rome "La Sapienza," Italy 11:55 Adding Epistemic Operators to Concept Languages Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf-U. Rome "La Sapienza," Italy Werner Nutt-German Research Ctr. for Artificial Intelligence 12:30 Lunch 2:15 Invited Talk: Twelve Years of Nonmonotonic Reasoning Research: Where (and What) is the Beef?, Ray Reiter (Abstract above) PROGRAM, BALLROOM B Monday, October 26 Sunday: Reception, 7:00-9:00 p.m. 8:30 Invited Talks: Reports from the Trenches, Peter Szolovits, Martha E. Pollack (Abstracts above) 9:50 Break Deduction I: Tractable Deductions 10:20 Learning Useful Horn Approximations Russell Greiner-Siemens Corporate Research, USA Dale Schuurmans-U.Toronto, Canada 10:55 Tractable Deduction in Knowledge Representation Systems Mukesh Dalal-Rutgers U.,USA 11:30 New Results on Local Inference Relations Robert Givan and David A. McAllester-Mass.Inst.of Tech., USA 12:05 Lunch Deduction II 1:50 Deduction with Constraints: The Substitutional Framework for Hybrid Reasoning Alan M. Frisch-U.Illinois, USA 2:25 An Order-Sorted Logic with Sort Literals and Disjointness Constraints Toni Bollinger, Udo Pletat-IBM Germany 3:00 Quantifier Elimination in Second Order Predicate Logic Dov Gabbay-Imperial College, UK Hans Jurgen Ohlbach-Max Planck Inst. for Computer Science, Germany 3:35 Break Logics of Belief and Intention 4:05 An Abstract Architecture for Rational Agents Anand S. Rao and Michael P. Georgeff-Australian Artificial Intelligence Inst. 4:40 Accessibility in Explicit Belief Logics James P. Delgrande-Simon Fraser U., Canada 5:15 A Study in the Logic of Intention M.D. Sadek-Centre National d'Etudes des Telecommunications,France ____________________________________________________________ Tuesday, October 27 Nonmonotonic Logics I 8:30 Maps between Nonmonotonic and Conditional Logic Horacio L. Arlo-Costa and Scott J. Shapiro-Columbia U.,USA 9:05 On the Connection between Nonmonotonic Inference Systems and Conditional Logics Gabriella Crocco, Philippe Lamarre-IRIT,France 9:40 From Monotonicity to Nonmonotonicity via a Theorem Prover Philippe Lamarre-IRIT,France 10:15 Break Diagnosis and Abduction I 10:45 Knowledge Representation and Incorporation in a Hybrid Reasoning System with Feedback Yeona Jang-Mass.Inst. of Technology,USA 11:20 Chosing Observations and Actions in Model-Based Diagnosis/Repair Systems Gerhard Friedrich, Wolfgang Nejdi-Technical U. Vienna, Austria 11:55 Lunch Diagnosis and Abduction II 1:40 Abductive Plan Recognition and Diagnosis: A Comprehensive Empirical Evaluation Hwee Tou Ng and Raymond J. Mooney-U.Texas at Austin,USA 2:15 Using Default and Causal Reasoning in Diagnosis Kurt Konolige-SRI International,USA 2:50 Focusing on Independent Diagnosis Problems Hartmut Freitag-Siemens, Germany Gerhard Friedrich-Technical U. Vienna, Austria 3:25 Break Diagnosis and Abduction III 3:55 A Minimality Maintenance System Olivier Raiman and Johan de Kleer-Xerox PARC,USA 4:30 Search through Systematic Set Enumeration Ron Rymon-U.Pennsylvania,USA 6:00 Banquet: Buses depart from main entrance of Sonesta ____________________________________________________________ Wednesday, October 28 Nonmonotonic Logics II 8:30 Bounding Introspection in Nonmonotonic Logic Grigori Schwarz-U.Delaware,USA 9:05 A Framework for Representing and Characterizing Semantics of Logic Programs Jurgen Dix-U.Karlsruhe,Germany 9:40 Answer SEts in General Nonmonotonic Reasoning Vladimir Lifschitz and Thomas Y.C. Wood-U.Texas at Austin,USA 10:15 Break Reasoning Architectures 10:45 An Architecture for Integrating Reasoning Paradigms James M. Skinner-Sandia National Laboratory,USA George F.Luger-U.New Mexico,USA 11:20 Concurrency Control for Knowledge Bases Vinay K.Chaudhri, Vassos Hadzilacos, John Mylopoulos, U.Toronto, Canada 11:55 Lunch Nonmonotonic Logics III: Tractable Reasoning 1:40 RS Theory: A Really Skeptical Theory of Inheritance with Exceptions Genevieve Simonet-LIRMM,France 2:15 On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning Ilkka Niemela, Jussi Ritanen-Helsinki U. Technology, Finland 2:50 All You Ever Wanted to Know about Tweety Gerhard Lakemeyer-U.Bonn,Germany 3:25 Break Nonmonotonic Logics IV: Default Reasoning 3:55 Representing Defaults as Sentences with Reduced Priority Mark Ryan-Imperial College,UK 4:30 Default Ranking: A Practical Framework for Evidential Reasoning, Belief Revision, and Update Moises Goldszmidt and Judea Pearl-U.CAlifornia at Los Angeles,USA 5:05 Representing Default Rules in Possibilistic Logic Salem Benferhat, Didier Dubois, Henri Prsade-U. Paul Sabatier,France 5:40 Break 8:00 Invited Talk: Resolving the Imagery Debate: A Cognitive Neuroscience Perspective, Stephen M. Kosslyn (Abstract above) ____________________________________________________________ Thursday, October 29 Nonmonotonic Logics V 8:30 Normative, Subjunctive, and Autoepistemic Defaults: Adopting the Ramsey Test Craig Boutiler-U. British Columbia, Canada 9:05 Asking about Possibilities-Revision and Update Semantics for Subjunctive Queries Wolfgang Nejdl, Markus Banagl-Technical U. Vienna, Austria 9:40 Reasoning from Inconsistency: A Taxonomy of Principles for Resolving Conflict Gadi Pinkas and Ronald P. Loui-Washington U.,USA 10:15 Break Nonmonotonic Logics VI 10:45 A Contraction Operator for Classical Propositional Logic Timothy M. Lownie-Queen's U.,Canada 11:20 A Temporal Revision Model for Reasoning about World Change M.O. Cordier-IRISA,France P.Siegel-LIUP,France 11:55 Computing Databases Updates Alvaro Del Val-Stanford U.,USA 12:30 Lunch 2:15 Invited Talk: Twelve Years of Nonmonotonic Reasoning Research: Where (and What) is the Beef?, Ray Reiter (Abstract above)