AFellner/PerfectRef
Project for Knowledge Representation and Ontologies. Implements the perfect reformulation algorithm for querying DL ontologies.
little program generating random formulae in SMT2 format as well as in DIMACS. They are fed to the z3 SMT Solver and the output is printed
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
Project for Knowledge Representation and Ontologies. Implements the perfect reformulation algorithm for querying DL ontologies.
This program enumerates all proofs for an arbiatrary propositional logic calculus up to a specified proof length.
This program will convert propositional formulae of a given JSON input format into an equisatisfiable conjunctive normal form. There are three different algorithms implemented to do the conversion. One of them uses paths through matrices.
A library for Proof Theory (especially Proof Compression) in Scala.