Tutorial on the Convolutional Tsetlin Machine
Implements the Tsetlin Machine, Coalesced Tsetlin Machine, Convolutional Tsetlin Machine, Regression Tsetlin Machine, and Weighted Tsetlin Machine, with support for continuous features, drop clause, Type III Feedback, focused negative sampling, multi-task classifier, autoencoder, literal budget, and one-vs-one multi-class classifier. TMU is writ…
Minesweeper game powered with an AI assistant to help you dodge all those dangerous mines!
Homework 3 using propositional logic-based agent
From LTLf/LDLf To Automata
Rogue-like AI agent for an adaptation of DreamQuest game.
Solving Wumpus World Problem using Propositional Logic
HCMUS - Artificial Intelligence - Lab 2: Popositional Logic - Resolution
This repository for implementations of Artificial intelligence algorithms
HCMUS - Artificial Intelligence - Project 2: Wumpus World
Analytic tableau based minimal model generator, model checker and theorem prover for first-order logic with modal extensions
Python package that provides an interface to work with classical propositional and first-order logic, based on my solutions to the textbook Mathematical Logic Through Python by Nisan and Gonczarowski
A python script which takes in complex propositional statements and processes them to generate a brute as well as reduced Disjunctive normal form for the statement along with the other information like Truth Table and Dont Cares.
Python library for computational formal logic, formal semantics, and theorem proving
Propositional Logic Theorem Prover using Resolution-Refutation takes Knowledge Base (i.e., formulae) and Query as input and implement a refutation proof (by first converting the given formulae into CNF), and report the result (1 if the query holds, and 0 otherwise). Additionally, the program have an option to print the resolution steps used in t…
A utility for proofs in the propositional calculus. Currently finished - a way of parsing (most) valid strings in the PC as Sentences which can be added to proofs. Working on a mechanism for machine proof.
TUM_AI_WS1516: The parser module reads ASCII strings and converts them into propositional logic formula. The entailment module reads two parsed propositional logic formulae A and B, and then it decides whether A != B or not.
Projects on symbolic systems, covering logic and problem solving (June 2020).
Solver for the game Overflow using propositional logic
Add a description, image, and links to the propositional-logic topic page so that developers can more easily learn about it.
To associate your repository with the propositional-logic topic, visit your repo's landing page and select "manage topics."