Efficient On-the-Fly Model Checking for LTL and CTL★.
-
Updated
Dec 21, 2019 - Haskell
Efficient On-the-Fly Model Checking for LTL and CTL★.
University courses, projects and homeworks
Resolução do trabalho prático 4 da UC Lógica Computacional. Temos 2 problemas, um problema relacionado com Verificação Formal de Software e outro problema relacionado com Sistemas Híbridos
Code of my talk at EASS 2023
Simple proof assistant written in OCaml.
Specification and client examples for the Byt-Wyze SAT Maker API (deterministic CES-weighted SAT instance generator).
Representación simbólica y clasificación de proposiciones: variables proposicionales, conectivas lógicas, tablas de verdad, tautologías, contradicciones y contingencias. Lógica Computacional, Ingeniería Informática.
Slides of my talk at EASS 2023
Deterministic SAT APIs, CNF preprocessing tools, and reproducible research standards.
Estrategias de formalización para la lógica de predicados de primer orden (LPO): traducción lenguaje natural-LPO, cuantificadores, instanciación y demostración de fórmulas. Lógica Computacional, Ingeniería Informática.
Permainan Global Conquest adalah sebuah game strategi yang dibuat menggunakan bahasa pemrograman deklaratif Prolog (GNU Prolog).
Project for Computational Logic (Semester 2 24/25), creating CLI based Pokemon game with Prolog.
Satisfiability of boolean formulas
Computational Logic Formula Solver - programmatically simplifies propositional and predicate logic formulas
Here you can find some exercises about introduction to programming in C++ language.
Unified Attractor Complexity Model - Mathematical framework for universal emergence and complexity
Add a description, image, and links to the computational-logic topic page so that developers can more easily learn about it.
To associate your repository with the computational-logic topic, visit your repo's landing page and select "manage topics."