galactose / wviews
Wviews is an artificial intelligence system extension for generating world view answer sets for epistemic logic programs
☆8Updated 6 years ago
Alternatives and similar repositories for wviews:
Users that are interested in wviews are comparing it to the libraries listed below
- System for eXtended Hybrid Abductive Inductive Learning☆25Updated 3 years ago
- Incremental Learning Event Definitions☆14Updated 9 years ago
- Declarative unit testing for Answer Set Programming projects☆12Updated 6 years ago
- VATA Tree Automata Library☆32Updated 6 months ago
- Stochastic Logic Programs (SLP) style probabilistic logic programming in miniKanren☆34Updated 12 years ago
- Dynamic programming inference by continuation hashing.☆29Updated 9 years ago
- A MiniKanren in Python☆35Updated 8 years ago
- General Inductive Logic Programming System☆17Updated 2 years ago
- Specify and synthesize systems using symbolic algorithms☆47Updated 3 months ago
- Sequitur and RePair grammar induction algorithms implementation☆24Updated last year
- Distributed constraint satisfaction with recursive message-passing agents☆16Updated 7 years ago
- A lightweight Description Logic reasoner for large-scale biomedical ontologies☆18Updated last month
- Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability☆63Updated 7 months ago
- ☆19Updated 7 years ago
- Automatic differentiation for NumPy☆42Updated 11 years ago
- My MSc thesis: a grammar induction system☆15Updated 8 years ago
- Python term rewriting☆29Updated 12 years ago
- A model checker for safe Petri nets based on partial-order semantics☆13Updated 4 years ago
- JudgeD: Probabilistic Datalog with Dependencies☆18Updated 5 years ago
- Port of Aleph to SWI-Prolog☆44Updated last year
- A rule engine based on Attempto Controlled English☆18Updated 3 months ago
- The new intelligent grounder of the logic-based Artificial Intelligence system DLV☆23Updated last year
- Knowledge Acquisition Logic Machine☆17Updated 5 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated 9 months ago
- CHR: Leuven Constraint Handling Rules☆24Updated 2 weeks ago
- DepQBF, a solver for quantified boolean formulae (QBF).☆34Updated last year
- MONA - a decision procedure for monadic second-order logic on finite strings and trees☆48Updated 4 years ago
- ☆13Updated 9 years ago
- VLog is a high-performance Datalog engine. It is highly memory efficient and can process large programs with thousands of rules.☆17Updated 6 years ago
- CoMingle: Distributed Logic Programming for Decentralized Mobile Ensembles☆33Updated 8 years ago