potassco / claspLinks
⚙️ A conflict-driven nogood learning answer set solver
☆128Updated this week
Alternatives and similar repositories for clasp
Users that are interested in clasp are comparing it to the libraries listed below
Sorting:
- 🦮 An introduction to our Answer Set Programming tools focusing on gringo, clingo, and clasp.☆83Updated 2 years ago
- ☆153Updated this week
- Pedagogical first-order prover in Python☆76Updated 4 months ago
- Git mirror of https://isabelle.in.tum.de/repos/isabelle☆72Updated this week
- Open-WBO: state-of-the-art MaxSAT and Pseudo-Boolean solver☆77Updated last year
- Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability☆68Updated last year
- The DRAT-trim proof checker☆65Updated 10 months ago
- The Standard Interface for Incremental Satisfiability Solving☆50Updated 3 years ago
- SAT Solver SATCH☆119Updated 3 years ago
- Metamath program - source code for the Metamath executable☆86Updated 2 months ago
- Kodkod solver for relational logic☆78Updated 2 years ago
- Specify and synthesize systems using symbolic algorithms☆50Updated 11 months ago
- Language based on Rewriting Logic☆137Updated 2 weeks ago
- An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics☆50Updated last week
- Conjure: The Automated Constraint Modelling Tool☆106Updated 3 weeks ago
- Spoofax runtime☆149Updated 5 months ago
- λ² is a tool for synthesizing functional programs from input-output examples.☆71Updated 2 years ago
- The LTSmin model checking toolset☆60Updated 11 months ago
- The Vampire Theorem Prover☆357Updated this week
- Benchmark problems for different models of automata, transducers, and related logics☆30Updated this week
- A lazy-grounding Answer-Set Programming system☆63Updated 7 months ago
- git mirror of the Munich isabelle hg repository☆127Updated this week
- An automated theorem prover that uses Büchi automata.☆43Updated 4 years ago
- A Modern Probabilistic Model Checker☆152Updated last week
- ⛓️ Extension of clingo to handle constraints over integers☆29Updated 3 weeks ago
- An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logt…☆151Updated 11 months ago
- Embeddable Lambda Prolog Interpreter☆327Updated this week
- Constraint Logic Programming over Integers☆209Updated last year
- Lem semantic definition language☆146Updated 6 months ago
- a Rust implementation of first-order term rewriting systems (TRS)☆28Updated 3 years ago