Predicate logic is an extension of propositional logic. Here we consider what is called first-order predicate logic, abbreviated FOL (sometimes abbreviated PL1, not to be confused with the programming ...

It is important to understand the relationship between cognitive abilities and language processing. Here, we explore a burgeoning area of research that harnesses semantic indices to predict cognitive ...

It is nearly inevitable that bugs will appear in a codebase during software development. To catch these bugs before they lead to real-world consequences, the formal verification community has ...

The propositional satisfiability problem (SAT) was the first to be shown NP-complete by Cook and Levin. SAT remained the embodiment of theoretical worst-case hardness. However, in stark contrast to ...

This post was co-authored with Professor John Vervaeke 1. Thinking, Fast and Slow is one of the great books written on cognition and decision making. In a clear and accessible fashion, it made popular ...

Hets is a parsing, static analysis and proof management tool incorporating various provers and different specification languages, thus providing a tool for heterogeneous specifications. Logic ...

Abstract: Tsetlin machines (TMs) are a promising approach to machine learning that uses Tsetlin Automata to produce patterns in propositional logic, leading to binary (hard) classifications. In many ...

Abstract: Due to the lack of appropriate theory to accurately characterize vulnerabilities, the current static detection technologies have two key challenges, i.e., limited applicability, and the ...

The possible ways that information can be represented mentally have been discussed often over the past thousand years. However, this issue could not be addressed rigorously until late in the 20th ...