Lecture

Inference Engines: Resolution and Horn Clauses

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 inference engines based on resolution, Horn clauses, filtering, and unification. It explains the concepts of inference without variables, inference with variables, applications, and summarizes the key points. The lecture delves into the importance of inference engines in artificial intelligence, focusing on resolution and chaining methods. It discusses the properties of inference engines, the practical aspects, and examples of resolution. The lecture also explores Horn clauses, Modus Ponens, and the practical application of inference engines. Additionally, it explains the quantification, Skolem functions, and the normalization of logical expressions.

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

Logic

Classical logic: First-order logic

Related concepts (32)

Quantifier (logic)

In logic, a quantifier is an operator that specifies how many individuals in the domain of discourse satisfy an open formula. For instance, the universal quantifier in the first order formula expresses that everything in the domain satisfies the property denoted by . On the other hand, the existential quantifier in the formula expresses that there exists something in the domain which satisfies that property. A formula where a quantifier takes widest scope is called a quantified formula.

Logical connective

In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant. They can be used to connect logical formulas. For instance in the syntax of propositional logic, the binary connective can be used to join the two atomic formulas and , rendering the complex formula . Common connectives include negation, disjunction, conjunction, implication, and equivalence.

Logical conjunction

In logic, mathematics and linguistics, and () is the truth-functional operator of conjunction or logical conjunction. The logical connective of this operator is typically represented as or or (prefix) or or in which is the most modern and widely used. The and of a set of operands is true if and only if all of its operands are true, i.e., is true if and only if is true and is true. An operand of a conjunction is a conjunct.

Universal quantification

In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", or "for any". It expresses that a predicate can be satisfied by every member of a domain of discourse. In other words, it is the predication of a property or relation to every member of the domain. It asserts that a predicate within the scope of a universal quantifier is true of every value of a predicate variable.

Logical disjunction

In logic, disjunction, also known as logical disjunction or logical or or logical addition or inclusive disjunction , is a logical connective typically notated as and read aloud as "or". For instance, the English language sentence "it is sunny or it is warm" can be represented in logic using the disjunctive formula , assuming that abbreviates "it is sunny" and abbreviates "it is warm". In classical logic, disjunction is given a truth functional semantics according to which a formula is true unless both and are false.

Related lectures (64)

Formal Logic: Proofs and Sets

Covers the basics of formal logic, focusing on logical expressions and mathematical proofs.

CS-101 Advanced information computation communication I Tuesday - September 24 | Fall 24

Landscape and Generalisation in Deep Learning

Explores the challenges and insights of deep learning, focusing on loss landscape, generalization, and feature learning.

Knowledge Representation: Introduction

Covers knowledge representation in AI, logical inference, and applications in various domains.

Physics-guided NMF for STEM/EDXS Data Analysis