Logic in computer science

Computational logic

Computational logic is the use of logic to perform or reason about computation. It bears a similar relationship to computer science and engineering as mathematical logic bears to mathematics and as philosophical logic bears to philosophy. It is synonymous with "logic in computer science". The term “computational logic” came to prominence with the founding of the ACM Transactions on Computational Logic in 2000. However, the term was introduced much earlier, by J.A. Robinson in 1970. The expression is used in the second paragraph with a footnote claiming that "computational logic" is "surely a better phrase than 'theorem proving', for the branch of artificial intelligence which deals with how to make machines do deduction efficiently". In 1972 the Metamathematics Unit at the University of Edinburgh was renamed “The Department of Computational Logic” in the School of Artificial Intelligence. The term was then used by Robert S. Boyer and J Strother Moore, who worked in the Department in the early 1970s, to describe their work on program verification and automated reasoning. They also founded Computational Logic Inc. Computational logic has also come to be associated with logic programming, because much of the early work in logic programming in the early 1970s also took place in the Department of Computational Logic in Edinburgh. It was reused in the early 1990s to describe work on extensions of logic programming in the EU Basic Research Project "Compulog" and in the associated Network of Excellence. Krzysztof Apt, who was the co-ordinator of the Basic Research Project Compulog-II, reused and generalized the term when he founded the ACM Transactions on Computational Logic in 2000 and became its first Editor-in-Chief. (Wikipedia).

Video thumbnail

Logic: The Structure of Reason

As a tool for characterizing rational thought, logic cuts across many philosophical disciplines and lies at the core of mathematics and computer science. Drawing on Aristotle’s Organon, Russell’s Principia Mathematica, and other central works, this program tracks the evolution of logic, be

From playlist Logic & Philosophy of Mathematics

Video thumbnail

Logic for Programmers: Propositional Logic

Logic is the foundation of all computer programming. In this video you will learn about propositional logic. 🔗Homework: http://www.codingcommanders.com/logic.php 🎥Logic for Programmers Playlist: https://www.youtube.com/playlist?list=PLWKjhJtqVAbmqk3-E3MPFVoWMufdbR4qW 🔗Check out the Cod

From playlist Logic for Programmers

Video thumbnail

Computational Semantics: How Computers Know what Words Mean [Lecture]

This is a single lecture from a course. If you you like the material and want more context (e.g., the lectures that came before), check out the whole course: https://boydgraber.org/teaching/CMSC_723/ (Including homeworks and reading.) Music: https://soundcloud.com/alvin-grissom-ii/review

From playlist Computational Linguistics I

Video thumbnail

Logical Reasoning: Become A Better Thinker

Logical thinking is also known as analytical reasoning, critical thinking or abstract thinking. It is an important trait, especially among developers in the software development industry. Without the logic, they would not understand how the software works, nor would they produce a clean co

From playlist Problem Solving

Video thumbnail

Understanding Computation

Hands on learning of computational theory for software developers from all walks of life. Using semantics and the barebones of the Ruby programming language, learn the meaning of programs and why specific algorithms do their job.

From playlist Programming Podcast

Video thumbnail

The Ultimate Guide to Propositional Logic for Discrete Mathematics

This is the ultimate guide to propositional logic in discrete mathematics. We cover propositions, truth tables, connectives, syntax, semantics, logical equivalence, translating english to logic, and even logic inferences and logical deductions. 00:00 Propositions 02:47 Connectives 05:13 W

From playlist Discrete Math 1

Video thumbnail

Algorithms Explained: Computational Complexity

An overview of computational complexity including the basics of big O notation and common time complexities with examples of each. Understanding computational complexity is vital to understanding algorithms and why certain constructions or implementations are better than others. Even if y

From playlist Algorithms Explained

Video thumbnail

Intro to Logical Statements

We begin our exploration into logic by analyzing LOGICAL STATEMENTS: 1) Define what a logical statement is 2) Recognize examples as logical statements or not logical statements 3) Use the symbols for "not", "and", and "or". 4) Break down a sentence into its logical structure. **********

From playlist Discrete Math (Full Course: Sets, Logic, Proofs, Probability, Graph Theory, etc)

Video thumbnail

Introduction to Predicate Logic

This video introduces predicate logic. mathispower4u.com

From playlist Symbolic Logic and Proofs (Discrete Math)

Video thumbnail

Stanford Seminar - Generalized Reversible Computing and the Unconventional Computing Landscape

EE380: Computer Systems Colloquium Seminar Generalized Reversible Computing and the Unconventional Computing Landscape Speaker: Michael P. Frank, Sandia National Laboratories With the end of transistor scaling now in sight, the raw energy efficiency (and thus, practical performance) of c

From playlist Stanford EE380-Colloquium on Computer Systems - Seminar Series

Video thumbnail

Lecture 8A: Logic Programming, Part 1

MIT 6.001 Structure and Interpretation of Computer Programs, Spring 2005 Instructor: Harold Abelson, Gerald Jay Sussman, Julie Sussman View the complete course: https://ocw.mit.edu/6-001S05 YouTube Playlist: https://www.youtube.com/playlist?list=PLE18841CABEA24090 Logic Programming, Part

From playlist MIT 6.001 Structure and Interpretation, 1986

Video thumbnail

Understanding Logic Gates | Computer Logic, Part 1

In this series, we take a look at the fundamentals of how computers work. We start with a look at logic gates, the basic building blocks of digital circuits. These gates include NOT, AND, OR, NAND, NOR, XOR, and XNOR. 0:00 Transistors 1:21 NOT 2:13 AND and OR 3:28 NAND and NOR 5:17 XOR a

From playlist Computer Logic

Video thumbnail

Clojure Conj 2012 - Challenges for Logic Programming

Challenges for Logic Programming by: Steve Miner The core.logic library (a port of miniKANREN) has sparked an interest in logic programming among Clojure users. Back in the '80s, logic programming inspired the Japanese Fifth Generation Computer Systems Project, which was poised to leap pa

From playlist Clojure Conf 2012

Video thumbnail

Proof synthesis and differential linear logic

Linear logic is a refinement of intuitionistic logic which, viewed as a functional programming language in the sense of the Curry-Howard correspondence, has an explicit mechanism for copying and discarding information. It turns out that, due to these mechanisms, linear logic is naturally r

From playlist Talks

Video thumbnail

Lecture 8A | MIT 6.001 Structure and Interpretation, 1986

Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at http://ocw.mit.edu/terms Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans,

From playlist MIT 6.001 Structure and Interpretation, 1986

Video thumbnail

Vacuum Tube Computer P.17 – Building the Logic Unit and Results Register

In this episode we continue finish our work on the ALU by making the “LU” part – the Logic Unit. But, just the Logic Unit on its own doesn’t answer the big question, which is how well does the ALU interact with the Results Register. On the Proof of Concept we built once upon a time, we ran

From playlist Vacuum Tube Computer

Video thumbnail

What is Quantum Machine Learning?

Generative machine learning is the field of ML that focuses on generating data. If you've seen any of the realistic-looking faces on pages such as www.thispersondoesnotexist.com or www.whichfaceisreal.com, you've seen generative machine learning in action. Quantum computing is a rapidly ad

From playlist Fundamentals of Machine Learning

Video thumbnail

Stanford Seminar - Computational memory: A stepping-stone to non-von Neumann computing?

EE380: Computer Systems Colloquium Seminar Computational memory: A stepping-stone to non-von Neumann computing? Speaker: Abu Sebastian, IBM Research - Zürich In the advent of the data-centric AI era and the imminent end of CMOS scaling laws, the time is ripe to adopt computing units base

From playlist Stanford EE380-Colloquium on Computer Systems - Seminar Series

Related pages

Automated reasoning | Type theory | Automated theorem proving | Mathematical logic | Formal verification | Logic in computer science | Mathematics | Computation | ACM Transactions on Computational Logic | Logic programming