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).
Slides of my talk at EASS 2023
Lexicoding™SaaS|Programing|Semantic Architecture|
🌐 Explore a living glossary of key terms and protocols that support the Lexicoding system for decoding reality and authoring timelines.
Deterministic SAT APIs, CNF preprocessing tools, and reproducible research standards.
Computational Logic - A monopoly board based tycoon game.
Computational Logic Formula Solver - programmatically simplifies propositional and predicate logic formulas
Permainan Global Conquest adalah sebuah game strategi yang dibuat menggunakan bahasa pemrograman deklaratif Prolog (GNU Prolog).
A project of a computational logic calculator based on college studies.
Here you can find some exercises about introduction to programming in C++ language.
Satisfiability of boolean formulas
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."