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
🌐 Explore a living glossary of key terms and protocols that support the Lexicoding system for decoding reality and authoring timelines.
Simple proof assistant written in OCaml.
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.
Specification and client examples for the Byt-Wyze SAT Maker API (deterministic CES-weighted SAT instance generator).
Slides of my talk at EASS 2023
Unified Attractor Complexity Model - Mathematical framework for universal emergence and complexity
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.
Pre-alpha Idris 2 semantic kernel and reference scheduler for normalizing typed action sequences under an at-most-once policy, with tested but non-production service scaffolding.
A Python script that leverages the datetime module and custom astrological date mappings to determine the current zodiac sign and print a birthday greeting.
Deterministic SAT APIs, CNF preprocessing tools, and reproducible research standards.
Guias de estudio, ejercicios practicos y talleres de cursos clave de Ingenieria de Sistemas: Logica y Programacion en Python y Matematicas Discretas.
Project for Computational Logic (Semester 2 24/25), creating CLI based Pokemon game with Prolog.
Permainan Global Conquest adalah sebuah game strategi yang dibuat menggunakan bahasa pemrograman deklaratif Prolog (GNU Prolog).
Satisfiability of boolean formulas
A project of a computational logic calculator based on college studies.
To associate your repository with the computational-logic topic, visit your repo's landing page and select "manage topics."