E-Book Overview
This book constitutes the refereed proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2004, held in Fort Lauderdale, Florida, USA in January 2004. The 24 revised full papers presented together with 8 system descriptions were carefully reviewed and selected for presentation. Among the topics addressed are declarative logic programming, nonmonotonic reasoning, knowledge representation, combinatorial search, answer set programming, constraint programming, deduction in ontologies, and planning.
E-Book Content
Lecture Notes in Artificial Intelligence Edited by J. G. Carbonell and J. Siekmann Subseries of Lecture Notes in Computer Science 2923 Springer Berlin Heidelberg New York Hong Kong London Milan Paris Tokyo Vladimir Lifschitz Ilkka Niemelä (Eds.) Logic Programming and Nonmonotonic Reasoning 7th International Conference, LPNMR 2004 Fort Lauderdale, FL, USA, January 6-8, 2004 Proceedings Springer eBook ISBN: Print ISBN: 3-540-24609-6 3-540-20721-X ©2005 Springer Science + Business Media, Inc. Print ©2004 Springer-Verlag Berlin Heidelberg Dordrecht All rights reserved No part of this eBook may be reproduced or transmitted in any form or by any means, electronic, mechanical, recording, or otherwise, without written consent from the Publisher Created in the United States of America Visit Springer's eBookstore at: and the Springer Global Website Online at: http://ebooks.kluweronline.com http://www.springeronline.com Preface The papers in this collection were presented at the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-7) in Fort Lauderdale, Florida, USA, during January 6–8, 2004. The previous meetings in this series were held in Washington, DC, USA (1991), Lisbon, Portugal (1993), Lexington, USA (1995), Dagstuhl, Germany (1997), El Paso, USA (1999), and Vienna, Austria (2001). LPNMR conferences are a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning and knowledge representation. In the 1980s researchers working in the area of nonmonotonic reasoning discovered that their formalisms could be used to describe the behavior of negation as failure in Prolog, and the first LPNMR meeting was convened for the purpose of discussing this relationship. This work has led to the creation of logic programming systems of a new kind, answer set solvers, and to the emergence of a new approach to solving combinatorial search problems, called answer set programming. The highlights of LPNMR-7 were three invited talks, given by Rina Dechter (University of California, Irvine), Henry Kautz (University of Washington) and Torsten Schaub (University of Potsdam). The program also included 24 regular papers selected after a rigorous review process, 8 system descriptions, and 2 panels. We would like to thank the Program Committee members and additional reviewers for careful, unbiased evaluation of the submitted papers. We are also grateful to Paolo Ferraris for help with publicizing the Call for Papers, to Fred Hoffman for help with local organizational matters, and to Matti Järvisalo for help with the organization of the electronic Program Committee meeting. October 2003 Vladimir Lifschitz Ilkka Niemelä Conference Organization Program Co-chairs Vladimir Lifschitz (University of Texas, USA) Ilkka Niemelä (Helsinki University of Technology, Finland) Program Committee José J. Alferes (New University of Lisbon, Portugal) Chitta Baral (Arizona State University, USA) Yannis Dimopoulos (University of Cyprus, Cyprus) Jürgen Dix (University of Manchester, UK) Phan Minh Dung (Asian Institute of Technology, Thailand) Esra Erdem (University of Toronto, Canada) Michael Gelfond (Texas Tech Univer