manospits / PhenestheLinks
'Phenesthe' (orig. φαίνεσθαι) is a system for the representation and processing of instantaneous and durative temporal phenomena.
☆21Updated 9 months ago
Alternatives and similar repositories for Phenesthe
Users that are interested in Phenesthe are comparing it to the libraries listed below
Sorting:
- C. Hocquette and A. Cropper, Relational program synthesis with numerical reasoning, AAAI23.☆17Updated 2 years ago
- CLP(BNR) module for SWI-Prolog☆44Updated 4 months ago
- Discuss future development☆21Updated 9 years ago
- Extended DCG syntax for Prolog by Peter Van Roy☆21Updated 7 years ago
- Top-down interpreter for ASP programs with Constraints☆33Updated 2 months ago
- Refactoring Tools for SWI-Prolog☆20Updated 8 months ago
- Randomized testing for Prolog à la QuickCheck☆23Updated 6 years ago
- LPTP: A Logic Program Theorem Prover, written by Robert F. Staerk in the mid 1990's☆11Updated 2 weeks ago
- top-down interpreter for ASP programs with constraints☆17Updated 2 years ago
- Prolog benchmarks (`van Roy' set)☆16Updated this week
- Programming in Tabled Prolog by David S Warren☆22Updated 5 years ago
- Simple BlackJack game via Browser using SWI Prolog, Tau Prolog☆10Updated 5 years ago
- Lightweight Prolog-like system designed to smoothly interoperate with deep learning tools☆29Updated last week
- The Heterogeneous Tool Set☆59Updated 7 months ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆30Updated 7 years ago
- General Inductive Logic Programming System☆18Updated 2 years ago
- Former home Java language client (master) for SWI-Prolog pengines - see simularity/JavaPengine☆10Updated 9 years ago
- Higher Order Prolog with Extensional Semantics☆53Updated 5 years ago
- Apply and compose functions in Prolog☆19Updated 8 years ago
- CHR: Leuven Constraint Handling Rules☆26Updated this week
- YAP Development release☆15Updated 4 years ago
- Yes, Erlang in SWI-Prolog!☆11Updated 7 years ago
- Fast, simplified WAM-based Prolog system☆24Updated 4 months ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated last year
- A lazy-grounding Answer-Set Programming system☆63Updated 6 months ago
- A General Multi-agent Epistemic Planner Based on Higher-order Belief Change☆10Updated 6 months ago
- RTEC is an Event Calculus implementation optimised for stream reasoning☆99Updated 3 months ago
- An efficient implementation of the higher-order logic programming language Lambda Prolog☆156Updated last year
- Offline partial evaluation system for Prolog written using the cogen approach☆20Updated 9 years ago
- ☆58Updated this week