Logic grammars have found wide application both in natural language processing and in formal applications such as compiler writing. This book introduces the main concepts involving natural and formal language processing in logic programming, and discusses typical problems which the reader may encounter, proposing various methods for solving them. The basic material is presented in depth; advanced material, involving new logic grammar formalisms and applications, is presented with a view towards breadth. Major sections of the book include: grammars for formal language and linguistic research, writing a simple logic grammar, different types of logic grammars, applications, and logic grammars and concurrency. This book is intended for those interested in logic programming, artificial intelligence, computational linguistics, Fifth Generation computing, formal languages and compiling techniques. It may be read profitably by upper-level undergraduates, post-graduate students, and active researchers on the above-named areas. Some familiarity with Prolog and logic programming would be helpful; the authors, however, briefly describe Prolog and its relation to logic grammars. After reading Logic Grammars, the reader will be able to cope with the ever-increasing literature of this new and exciting field.

This book constitutes the refereed proceedings of the 23rd International Conference on Logic Programming, ICLP 2007, held in Porto, Portugal, September 8-13, 2007.

The 22 revised full papers together with 2 invited talks as well as 15 poster presentations and the abstracts of 5 doctoral consortium articles were carefully reviewed and selected from 74 initial submissions. The papers cover all issues of current research in logic programming - they are organized in topical sections on theory, functional and constraint logic programming, program analysis, answer-set programming, semantics, and applications.

The Fifth International Symposium on Practical Aspects of Declarative L- guages (PADL 2003) was held in New Orleans on 13-14 January 2003. It was colocatedwiththe30thAnnualACMSymposiumonPrinciplesofProgramming Languages(POPL2003). We received 57 submissions, a record for PADL. One of the strengths of PADL is that it draws papers from both sides of the declarative divide, from boththefunctionalandlogicprogrammingcommunities.Ofthe57submissions, 25werefunctionaland32werelogical, withsomenotableoverlaps. The program committee was divided on the approach to take to the con- rence.Thosefromthelogicprogrammingcommunitypreferredtohaveparallel sessionsinordertoacceptmorepapers, thosefromthefunctionalprogramming communitypreferredtoavoidparallelsessionsthoughitmeantacceptingfewer papers. We decided to ?nd strength in diversity, and experiment with taking both paths. We accepted 8 papers on functional programming, each presented initsownslot, and15papersonlogicprogramming,10ofwhicharepresentedin parallelsessions.Wefeltthatpapersfrombothcommunitieswerecomparablein quality.Theratioof4hoursoffunctionaltalksto5hoursoflogictalksmatches theratioofsubmissions. WhilemostpaperssubmittedtoPADLaretraditionalresearchpapers, some weresubmittedasApplicationLettersorDeclarativePearls.Traditionalpapers maybejudgedonwhethertheypresentacrispnewresearchresult;Application Lettersmaybejudgedaccordingtotheinterestintheapplicationandthenovel useofdeclarativelanguages;andDeclarativePearlsmaybejudgedaccordingto theeleganceofthedevelopmentandtheclarityoftheexpression. This year PADL instituted a "Most Practical" paper award, for the paper that best exempli?ed the goals of PADL. The award went to "Data mining the yeast genome in a lazy functional language," Amanda Clare and Ross D. King, UniversityofWales, Aberystwyth, whichdescribesareal-wordapplication runningonmultiprocessors, drawingontechniquesfromboththefunctionaland logicprogrammingcommunities. Special thanks are due: to Shriram Krishnamurthi, Dave Tucker, and Paul Graunke of Brown University, for running the website of the PADL submission andreviewprocess(seeKrishnamurthi'sinvitedtalkinthisvolume);toMartina SharpofAvayaLabsandKimberlyVollofSimonFraserUniversity, forhelpwith preparingthisvolume;andtoGopalGuptaoftheUniversityofTexasatDallas, for serving as general chair. We thank Avaya Labs, Brown University, Simon FraserUniversity, Universit edeProvence, andtheUniversityofTexasatDallas fortheirsupport. Ourthankstotheprogramcommitteemembersandrefereesfortheirrev- wingandfortheiradvice.Finally, ourthankstoallthosewhosubmittedpapers toorparticipatedinPADL2003."

This volume was motivated by the Year of Prolog initiative, launched to celebrate the 50th anniversary of the emergence of Prolog through the work of Alain Colmerauer’s team in Marseille. The volume editors, authors, and scientific advisors and reviewers have been the leading researchers and programmers in this field over decades, and the book represents an excellent overview of the field, its successes, and its future.After a first chapter that gently introduces the Prolog programming language using examples, the next 7 papers discuss general views of the language, possible extensions for the future, and how Prolog can generally be used to solve problems; the next 5 papers explore ideas and experiences of teaching Prolog programming and then 2 papers discuss technology that has been developed for help in that teaching; the next 3 papers describe new languages based on Prolog which show future directions for logic programming; the next 5 chapters explain the applications that were the finalists for the 2022 Alain Colmerauer Prize; and the final 8 papers describe applications developed using the Prolog language, demonstrating the language’s range.

The concept of "constraint" is widely used in linguistics, computer science, and psychology. However, its implementation varies widely depending on the research domain: namely, language description, knowledge representation, cognitive modelling, and problem solving. These various uses of constraints offer complementary views on intelligent mechanisms. For example, in-depth descriptions implementing constraints are used in linguistics to filter out syntactic or discursive structures by means of dedicated description languages and constraint ranking. In computer science, the constraint programming paradigm views constraints as a whole, which can be used, for example, to build specific structures. Finally, in psycholinguistics, experiments are carried out to investigate the role of constraints within cognitive processes (both in comprehension and production), with various applications such as dialog modelling for people with disabilities. In this context, Constraints and Language builds an extended overview of the use of constraints to model and process language. This book will be useful for researchers willing to get a grip on the various uses of constraints in natural language processing, and also as a class book for academic staff who want to set up advanced courses around the concept of constraint-based natural language processing.