Lecture

Search Algorithms: Abductive Reasoning

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

CS-330: Artificial intelligence

Introduction aux techniques de l'Intelligence Artificielle, complémentée par des exercices de programmation qui montrent les algorithmes et des exemples de leur application à des problèmes pratiques. ...

Description

This lecture covers abductive reasoning and search algorithms, focusing on the concepts of search without costs, search with costs, and computation time. It explores examples like diagnosing an electrical circuit and discusses the monotonicity of deduction. The lecture delves into logical inferences and the best practices for problem-solving through search algorithms. It also explains the formalization of search algorithms, the generation of successors, and the criteria for success. The lecture concludes with a detailed explanation of heuristic search algorithms, such as A*, and their applications in optimizing solutions.

Instructor

Boi Faltings

Professor Faltings joined EPFL in 1987 as professor of Artificial Intelligence. He holds a PhD degree from the University of Illinois at Urbana-Champaign, and a diploma from the ETHZ. His research has spanned different areas of intelligent systems linked to model-based reasoning. In particular, he has contributed to qualitative spatial reasoning, case-based reasoning (especially for design problems), constraint satisfaction for design and logistics problems, multi-agent systems, and intelligent user interfaces. His current work is oriented towards multi-agent systems and social computing, using concepts of game theory, constraint optimization and machine learning. In 1999, Professor Faltings co-founded Iconomic Systems, a company that developed a new agent-based paradigm for travel e-commerce. He has since co-founded 5 other startup companies and advised several others. Prof. Faltings has published more than 150 refereed papers on his work, and participates regularly in program committees of all major conferences in the field. He has served as associate editor of of the major journals, including the Journal of Artificial Intelligence Research (JAIR) and the Artificial Intelligence Journal. From 1996 to 1998, he served as head of the computer science department.

Official source

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Philosophy

Epistemology: Reason

Related concepts (32)

Abductive reasoning

Abductive reasoning (also called abduction, abductive inference, or retroduction) is a form of logical inference that seeks the simplest and most likely conclusion from a set of observations. It was formulated and advanced by American philosopher Charles Sanders Peirce beginning in the last third of the 19th century. Abductive reasoning, unlike deductive reasoning, yields a plausible conclusion but does not definitively verify it. Abductive conclusions do not eliminate uncertainty or doubt, which is expressed in retreat terms such as "best available" or "most likely".

Cost

In production, research, retail, and accounting, a cost is the value of money that has been used up to produce something or deliver a service, and hence is not available for use anymore. In business, the cost may be one of acquisition, in which case the amount of money expended to acquire it is counted as cost. In this case, money is the input that is gone in order to acquire the thing. This acquisition cost may be the sum of the cost of production as incurred by the original producer, and further costs of transaction as incurred by the acquirer over and above the price paid to the producer.

Heuristic

A heuristic (hjʊˈrɪstɪk; ), or heuristic technique, is any approach to problem solving or self-discovery that employs a practical method that is not guaranteed to be optimal, perfect, or rational, but is nevertheless sufficient for reaching an immediate, short-term goal or approximation. Where finding an optimal solution is impossible or impractical, heuristic methods can be used to speed up the process of finding a satisfactory solution. Heuristics can be mental shortcuts that ease the cognitive load of making a decision.

Algorithm

In mathematics and computer science, an algorithm (ˈælɡərɪðəm) is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning), achieving automation eventually.

Deductive reasoning

Deductive reasoning is the mental process of drawing deductive inferences. An inference is deductively valid if its conclusion follows logically from its premises, i.e. it is impossible for the premises to be true and the conclusion to be false. For example, the inference from the premises "all men are mortal" and "Socrates is a man" to the conclusion "Socrates is mortal" is deductively valid. An argument is sound if it is valid and all its premises are true.

Related lectures (64)

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Search Algorithms: Abductive Reasoning

Covers search algorithms, focusing on abductive reasoning and heuristic search strategies.

Minimum Spanning Trees: Prim's Algorithm

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Graph Algorithms II: Traversal and Paths

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Deliberative Agents: Planning and Strategies