Answer Set Programming - Hardcover

Lifschitz, Vladimir

Hardcover

ISBN 10: 3030246574 ISBN 13: 9783030246570

Verlag: Springer, 2019

Inhaltsangabe

ANSWER SET PROGRAMMING (ASP) IS A PROGRAMMING METHODOLOGY ORIENTED TOWARDS COMBINATORIAL SEARCH PROBLEMS.&NBSP; IN SUCH A PROBLEM, THE GOAL IS TO FIND A SOLUTION AMONG A LARGE BUT FINITE NUMBER OF POSSIBILITIES. THE IDEA OF ASP CAME FROM RESEARCH ON ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL LOGIC. ASP IS A FORM OF DECLARATIVE PROGRAMMING: AN ASP PROGRAM DESCRIBES WHAT IS COUNTED AS A SOLUTION TO THE PROBLEM, BUT DOES NOT SPECIFY AN ALGORITHM FOR SOLVING IT.&NBSP; SEARCH IS PERFORMED BY SOPHISTICATED SOFTWARE SYSTEMS CALLED ANSWER SET SOLVERS.<P>COMBINATORIAL SEARCH PROBLEMS OFTEN ARISE IN SCIENCE AND TECHNOLOGY, AND ASP HAS FOUND APPLICATIONS IN DIVERSE AREAS—IN HISTORICAL LINGUISTIC, IN BIOINFORMATICS, IN ROBOTICS, IN SPACE EXPLORATION, IN OIL AND GAS INDUSTRY, AND MANY OTHERS.&NBSP; THE IMPORTANCE OF THIS PROGRAMMING METHOD WAS RECOGNIZED BY THE ASSOCIATION FOR THE ADVANCEMENT OF ARTIFICIAL INTELLIGENCE IN 2016, WHEN <I>AI MAGAZINE</I> PUBLISHED A SPECIAL ISSUE ON ANSWER SET PROGRAMMING.</P> <P>THE BOOK WILL INTRODUCE THE READER TO THE THEORY AND PRACTICE OF ASP. IT WILL DESCRIBE THE INPUT LANGUAGE OF THE ANSWER SET SOLVER CLINGO, WHICH WAS DESIGNED AT THE UNIVERSITY OF POTSDAM IN GERMANY AND IS USED TODAY BY ASP PROGRAMMERS IN MANY COUNTRIES.&NBSP; IT WILL INCLUDE NUMEROUS EXAMPLES OF ASP PROGRAMS AND PRESENT THE MATHEMATICAL THEORY THAT ASP IS BASED ON.&NBSP; THERE WILL BE MANY EXERCISES WITH COMPLETE SOLUTIONS.</P>

Über diesen Titel

Reseña del editor

Answer set programming (ASP) is a programming methodology oriented towards combinatorial search problems.  In such a problem, the goal is to find a solution among a large but finite number of possibilities. The idea of ASP came from research on artificial intelligence and computational logic. ASP is a form of declarative programming: an ASP program describes what is counted as a solution to the problem, but does not specify an algorithm for solving it.  Search is performed by sophisticated software systems called answer set solvers.

Combinatorial search problems often arise in science and technology, and ASP has found applications in diverse areas―in historical linguistic, in bioinformatics, in robotics, in space exploration, in oil and gas industry, and many others.  The importance of this programming method was recognized by the Association for the Advancement of Artificial Intelligence in 2016, when AI Magazine published a special issue on answer set programming.

The book will introduce the reader to the theory and practice of ASP. It will describe the input language of the answer set solver CLINGO, which was designed at the University of Potsdam in Germany and is used today by ASP programmers in many countries.  It will include numerous examples of ASP programs and present the mathematical theory that ASP is based on.  There will be many exercises with complete solutions.

Biografía del autor

Vladimir Lifschitz is a Professor of Computer Science at the University of Texas at Austin and a Fellow of the Association for the Advancement of Artificial Intelligence.  He received a degree in Mathematics from the Steklov Mathematical Institute in Leningrad, USSR in 1971. A few years later he came to the United States, and his research interests turned to computational logic and knowledge representation. Lifschitz has written over 60 papers on logic programming, coined the term “answer set programming," and received several awards for publications in this area, including a Most Influential Paper in 20 Years Award and a Test of Time Award from the Association for Logic Programming.  Lifschitz has served as the Editor-in-Chief of ACM Transactions on Computational Logic and as a member of the Editorial Board of the journal Artificial Intelligence.

Über diese Auflage

• Verlag: Springer
• Erscheinungsdatum: 2019
• ISBN 10: 3030246574
• ISBN 13: 9783030246570
• Einband: Tapa dura
• Auflage: 1
• Anzahl der Seiten: 204