Author: Vladimir Lifschitz
Publisher: Springer Nature
ISBN: 3030246582
Category : Computers
Languages : en
Pages : 196
Book Description
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 introduces the reader to the theory and practice of ASP. It describes 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 includes numerous examples of ASP programs and present the mathematical theory that ASP is based on. There are many exercises with complete solutions.
Answer Set Programming
Author: Vladimir Lifschitz
Publisher: Springer Nature
ISBN: 3030246582
Category : Computers
Languages : en
Pages : 196
Book Description
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 introduces the reader to the theory and practice of ASP. It describes 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 includes numerous examples of ASP programs and present the mathematical theory that ASP is based on. There are many exercises with complete solutions.
Publisher: Springer Nature
ISBN: 3030246582
Category : Computers
Languages : en
Pages : 196
Book Description
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 introduces the reader to the theory and practice of ASP. It describes 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 includes numerous examples of ASP programs and present the mathematical theory that ASP is based on. There are many exercises with complete solutions.
Answer Set Solving in Practice
Author: Martin Liu
Publisher: Springer Nature
ISBN: 3031015614
Category : Computers
Languages : en
Pages : 212
Book Description
Answer Set Programming (ASP) is a declarative problem solving approach, initially tailored to modeling problems in the area of Knowledge Representation and Reasoning (KRR). More recently, its attractive combination of a rich yet simple modeling language with high-performance solving capacities has sparked interest in many other areas even beyond KRR. This book presents a practical introduction to ASP, aiming at using ASP languages and systems for solving application problems. Starting from the essential formal foundations, it introduces ASP's solving technology, modeling language and methodology, while illustrating the overall solving process by practical examples. Table of Contents: List of Figures / List of Tables / Motivation / Introduction / Basic modeling / Grounding / Characterizations / Solving / Systems / Advanced modeling / Conclusions
Publisher: Springer Nature
ISBN: 3031015614
Category : Computers
Languages : en
Pages : 212
Book Description
Answer Set Programming (ASP) is a declarative problem solving approach, initially tailored to modeling problems in the area of Knowledge Representation and Reasoning (KRR). More recently, its attractive combination of a rich yet simple modeling language with high-performance solving capacities has sparked interest in many other areas even beyond KRR. This book presents a practical introduction to ASP, aiming at using ASP languages and systems for solving application problems. Starting from the essential formal foundations, it introduces ASP's solving technology, modeling language and methodology, while illustrating the overall solving process by practical examples. Table of Contents: List of Figures / List of Tables / Motivation / Introduction / Basic modeling / Grounding / Characterizations / Solving / Systems / Advanced modeling / Conclusions
Knowledge Representation, Reasoning, and the Design of Intelligent Agents
Author: Michael Gelfond
Publisher: Cambridge University Press
ISBN: 1107782872
Category : Computers
Languages : en
Pages : 363
Book Description
Knowledge representation and reasoning is the foundation of artificial intelligence, declarative programming, and the design of knowledge-intensive software systems capable of performing intelligent tasks. Using logical and probabilistic formalisms based on answer set programming (ASP) and action languages, this book shows how knowledge-intensive systems can be given knowledge about the world and how it can be used to solve non-trivial computational problems. The authors maintain a balance between mathematical analysis and practical design of intelligent agents. All the concepts, such as answering queries, planning, diagnostics, and probabilistic reasoning, are illustrated by programs of ASP. The text can be used for AI-related undergraduate and graduate classes and by researchers who would like to learn more about ASP and knowledge representation.
Publisher: Cambridge University Press
ISBN: 1107782872
Category : Computers
Languages : en
Pages : 363
Book Description
Knowledge representation and reasoning is the foundation of artificial intelligence, declarative programming, and the design of knowledge-intensive software systems capable of performing intelligent tasks. Using logical and probabilistic formalisms based on answer set programming (ASP) and action languages, this book shows how knowledge-intensive systems can be given knowledge about the world and how it can be used to solve non-trivial computational problems. The authors maintain a balance between mathematical analysis and practical design of intelligent agents. All the concepts, such as answering queries, planning, diagnostics, and probabilistic reasoning, are illustrated by programs of ASP. The text can be used for AI-related undergraduate and graduate classes and by researchers who would like to learn more about ASP and knowledge representation.
Reasoning Web. Semantic Technologies for Information Systems
Author: Sergio Tessaris
Publisher: Springer Science & Business Media
ISBN: 3642037534
Category : Computers
Languages : en
Pages : 364
Book Description
This book contains a collection of revised tutorial papers based on lectures given by researchers at the 5th International Summer School on the Reasoning Web. It introduces semantic web methods and research issues with a particular emphasis on reasoning.
Publisher: Springer Science & Business Media
ISBN: 3642037534
Category : Computers
Languages : en
Pages : 364
Book Description
This book contains a collection of revised tutorial papers based on lectures given by researchers at the 5th International Summer School on the Reasoning Web. It introduces semantic web methods and research issues with a particular emphasis on reasoning.
Inductive Logic Programming
Author: Stephen Muggleton
Publisher: Boom Koninklijke Uitgevers
ISBN: 9783540634942
Category : Computers
Languages : en
Pages : 414
Book Description
This book constitutes the strictly refereed post-workshop proceedings of the 6th International Workshop on Inductive Logic Programming, ILP-96, held in Stockholm, Sweden, in August 1996. The 21 full papers were carefully reviewed and selected for inclusion in the book in revised version. Also included is the invited contribution "Inductive logic programming for natural language processing" by Raymond J. Mooney. Among the topics covered are natural language learning, drug design, NMR and ECG analysis, glaucoma diagnosis, efficiency measures for implementations and database interaction, program synthesis, proof encoding and learning in the absence of negative data, and least generalizations under implication ordering.
Publisher: Boom Koninklijke Uitgevers
ISBN: 9783540634942
Category : Computers
Languages : en
Pages : 414
Book Description
This book constitutes the strictly refereed post-workshop proceedings of the 6th International Workshop on Inductive Logic Programming, ILP-96, held in Stockholm, Sweden, in August 1996. The 21 full papers were carefully reviewed and selected for inclusion in the book in revised version. Also included is the invited contribution "Inductive logic programming for natural language processing" by Raymond J. Mooney. Among the topics covered are natural language learning, drug design, NMR and ECG analysis, glaucoma diagnosis, efficiency measures for implementations and database interaction, program synthesis, proof encoding and learning in the absence of negative data, and least generalizations under implication ordering.
Handbook of Satisfiability
Author: A. Biere
Publisher: IOS Press
ISBN: 1643681613
Category : Computers
Languages : en
Pages : 1486
Book Description
Propositional logic has been recognized throughout the centuries as one of the cornerstones of reasoning in philosophy and mathematics. Over time, its formalization into Boolean algebra was accompanied by the recognition that a wide range of combinatorial problems can be expressed as propositional satisfiability (SAT) problems. Because of this dual role, SAT developed into a mature, multi-faceted scientific discipline, and from the earliest days of computing a search was underway to discover how to solve SAT problems in an automated fashion. This book, the Handbook of Satisfiability, is the second, updated and revised edition of the book first published in 2009 under the same name. The handbook aims to capture the full breadth and depth of SAT and to bring together significant progress and advances in automated solving. Topics covered span practical and theoretical research on SAT and its applications and include search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results. SAT is interpreted in a broad sense, so as well as propositional satisfiability, there are chapters covering the domain of quantified Boolean formulae (QBF), constraints programming techniques (CSP) for word-level problems and their propositional encoding, and satisfiability modulo theories (SMT). An extensive bibliography completes each chapter. This second edition of the handbook will be of interest to researchers, graduate students, final-year undergraduates, and practitioners using or contributing to SAT, and will provide both an inspiration and a rich resource for their work. Edmund Clarke, 2007 ACM Turing Award Recipient: "SAT solving is a key technology for 21st century computer science." Donald Knuth, 1974 ACM Turing Award Recipient: "SAT is evidently a killer app, because it is key to the solution of so many other problems." Stephen Cook, 1982 ACM Turing Award Recipient: "The SAT problem is at the core of arguably the most fundamental question in computer science: What makes a problem hard?"
Publisher: IOS Press
ISBN: 1643681613
Category : Computers
Languages : en
Pages : 1486
Book Description
Propositional logic has been recognized throughout the centuries as one of the cornerstones of reasoning in philosophy and mathematics. Over time, its formalization into Boolean algebra was accompanied by the recognition that a wide range of combinatorial problems can be expressed as propositional satisfiability (SAT) problems. Because of this dual role, SAT developed into a mature, multi-faceted scientific discipline, and from the earliest days of computing a search was underway to discover how to solve SAT problems in an automated fashion. This book, the Handbook of Satisfiability, is the second, updated and revised edition of the book first published in 2009 under the same name. The handbook aims to capture the full breadth and depth of SAT and to bring together significant progress and advances in automated solving. Topics covered span practical and theoretical research on SAT and its applications and include search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results. SAT is interpreted in a broad sense, so as well as propositional satisfiability, there are chapters covering the domain of quantified Boolean formulae (QBF), constraints programming techniques (CSP) for word-level problems and their propositional encoding, and satisfiability modulo theories (SMT). An extensive bibliography completes each chapter. This second edition of the handbook will be of interest to researchers, graduate students, final-year undergraduates, and practitioners using or contributing to SAT, and will provide both an inspiration and a rich resource for their work. Edmund Clarke, 2007 ACM Turing Award Recipient: "SAT solving is a key technology for 21st century computer science." Donald Knuth, 1974 ACM Turing Award Recipient: "SAT is evidently a killer app, because it is key to the solution of so many other problems." Stephen Cook, 1982 ACM Turing Award Recipient: "The SAT problem is at the core of arguably the most fundamental question in computer science: What makes a problem hard?"
Reasoning Web. Declarative Artificial Intelligence
Author: Marco Manna
Publisher: Springer Nature
ISBN: 303060067X
Category : Computers
Languages : en
Pages : 263
Book Description
This volume contains 8 lecture notes of the 16th Reasoning Web Summer School (RW 2020), held in Oslo, Norway, in June 2020. The Reasoning Web series of annual summer schools has become the prime educational event in the field of reasoning techniques on the Web, attracting both young and established researchers. The broad theme of this year's summer school was “Declarative Artificial Intelligence” and it covered various aspects of ontological reasoning and related issues that are of particular interest to Semantic Web and Linked Data applications. The following eight lectures have been presented during the school: Introduction to Probabilistic Ontologies, On the Complexity of Learning Description Logic Ontologies, Explanation via Machine Arguing, Stream Reasoning: From Theory to Practice, First-Order Rewritability of Temporal Ontology-Mediated Queries, An Introduction to Answer Set Programming and Some of Its Extensions, Declarative Data Analysis using Limit Datalog Programs, and Knowledge Graphs: Research Directions.
Publisher: Springer Nature
ISBN: 303060067X
Category : Computers
Languages : en
Pages : 263
Book Description
This volume contains 8 lecture notes of the 16th Reasoning Web Summer School (RW 2020), held in Oslo, Norway, in June 2020. The Reasoning Web series of annual summer schools has become the prime educational event in the field of reasoning techniques on the Web, attracting both young and established researchers. The broad theme of this year's summer school was “Declarative Artificial Intelligence” and it covered various aspects of ontological reasoning and related issues that are of particular interest to Semantic Web and Linked Data applications. The following eight lectures have been presented during the school: Introduction to Probabilistic Ontologies, On the Complexity of Learning Description Logic Ontologies, Explanation via Machine Arguing, Stream Reasoning: From Theory to Practice, First-Order Rewritability of Temporal Ontology-Mediated Queries, An Introduction to Answer Set Programming and Some of Its Extensions, Declarative Data Analysis using Limit Datalog Programs, and Knowledge Graphs: Research Directions.
Handbook of Parallel Constraint Reasoning
Author: Youssef Hamadi
Publisher: Springer
ISBN: 3319635166
Category : Computers
Languages : en
Pages : 687
Book Description
This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units. The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP), constraint programming (CP), stochastic local search (SLS), optimal path finding with A*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD). The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.
Publisher: Springer
ISBN: 3319635166
Category : Computers
Languages : en
Pages : 687
Book Description
This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units. The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP), constraint programming (CP), stochastic local search (SLS), optimal path finding with A*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD). The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.
Commonsense Reasoning
Author: Erik T. Mueller
Publisher: Elsevier
ISBN: 0080476619
Category : Computers
Languages : en
Pages : 431
Book Description
To endow computers with common sense is one of the major long-term goals of Artificial Intelligence research. One approach to this problem is to formalize commonsense reasoning using mathematical logic. Commonsense Reasoning is a detailed, high-level reference on logic-based commonsense reasoning. It uses the event calculus, a highly powerful and usable tool for commonsense reasoning, which Erik T. Mueller demonstrates as the most effective tool for the broadest range of applications. He provides an up-to-date work promoting the use of the event calculus for commonsense reasoning, and bringing into one place information scattered across many books and papers. Mueller shares the knowledge gained in using the event calculus and extends the literature with detailed event calculus solutions to problems that span many areas of the commonsense world. - Covers key areas of commonsense reasoning including action, change, defaults, space, and mental states. - The first full book on commonsense reasoning to use the event calculus. - Contextualizes the event calculus within the framework of commonsense reasoning, introducing the event calculus as the best method overall. - Focuses on how to use the event calculus formalism to perform commonsense reasoning, while existing papers and books examine the formalisms themselves. - Includes fully worked out proofs and circumscriptions for every example.
Publisher: Elsevier
ISBN: 0080476619
Category : Computers
Languages : en
Pages : 431
Book Description
To endow computers with common sense is one of the major long-term goals of Artificial Intelligence research. One approach to this problem is to formalize commonsense reasoning using mathematical logic. Commonsense Reasoning is a detailed, high-level reference on logic-based commonsense reasoning. It uses the event calculus, a highly powerful and usable tool for commonsense reasoning, which Erik T. Mueller demonstrates as the most effective tool for the broadest range of applications. He provides an up-to-date work promoting the use of the event calculus for commonsense reasoning, and bringing into one place information scattered across many books and papers. Mueller shares the knowledge gained in using the event calculus and extends the literature with detailed event calculus solutions to problems that span many areas of the commonsense world. - Covers key areas of commonsense reasoning including action, change, defaults, space, and mental states. - The first full book on commonsense reasoning to use the event calculus. - Contextualizes the event calculus within the framework of commonsense reasoning, introducing the event calculus as the best method overall. - Focuses on how to use the event calculus formalism to perform commonsense reasoning, while existing papers and books examine the formalisms themselves. - Includes fully worked out proofs and circumscriptions for every example.
The Logic Programming Paradigm
Author: Krzysztof R. Apt
Publisher: Springer Science & Business Media
ISBN: 3642600859
Category : Computers
Languages : en
Pages : 457
Book Description
This exciting new text reveals both the evolution of this programming paradigm since its inception and the impressively broad scope of current research in the field. The contributors to this book are all leading world experts in Logic Programming, and they deal with both theoretical and practical issues. They address such diverse topics as: computational molecular biology, machine learning, mobile computing, multi-agent systems, planning, numerical computing and dynamical systems, database systems, an alternative to the "formulas as types" approach, program semantics and analysis, and natural language processing. XXXXXXX Neuer Text Logic Programming was founded 25 years ago. This exciting book reveals both the evolution of this programming paradigm and its impressively broad scope of current research. The contributions by leading computer scientists deal with both theoretical and practical issues. They address diverse topics such as: computational molecular biology, machine learning, mobile computing, multi-agent systems, numerical computing and dynamical systems, database systems, program semantics, natural language processing, and promising future directions.
Publisher: Springer Science & Business Media
ISBN: 3642600859
Category : Computers
Languages : en
Pages : 457
Book Description
This exciting new text reveals both the evolution of this programming paradigm since its inception and the impressively broad scope of current research in the field. The contributors to this book are all leading world experts in Logic Programming, and they deal with both theoretical and practical issues. They address such diverse topics as: computational molecular biology, machine learning, mobile computing, multi-agent systems, planning, numerical computing and dynamical systems, database systems, an alternative to the "formulas as types" approach, program semantics and analysis, and natural language processing. XXXXXXX Neuer Text Logic Programming was founded 25 years ago. This exciting book reveals both the evolution of this programming paradigm and its impressively broad scope of current research. The contributions by leading computer scientists deal with both theoretical and practical issues. They address diverse topics such as: computational molecular biology, machine learning, mobile computing, multi-agent systems, numerical computing and dynamical systems, database systems, program semantics, natural language processing, and promising future directions.