Showing 3 open source projects for "which"

View related business solutions
  • Go From Idea to Deployed AI App Fast Icon
    Go From Idea to Deployed AI App Fast

    One platform to build, fine-tune, and deploy. No MLOps team required.

    Access Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
    Try Free
  • Host LLMs in Production With On-Demand GPUs Icon
    Host LLMs in Production With On-Demand GPUs

    NVIDIA L4 GPUs. 5-second cold starts. Scale to zero when idle.

    Deploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
    Try Free
  • 1
    GNU Prolog

    GNU Prolog

    The GNU Prolog native compiler

    GNU Prolog is a free implementation (under GPL) of the logic programming language PROLOG. It can compile to native machine code which is extremely fast in execution. Another feature is the included constraint solver.
    Leader badge
    Downloads: 273 This Week
    Last Update:
    See Project
  • 2
    Programming Language ADP

    Programming Language ADP

    ADP is a script language designed for Web database prgramming.

    ADP (Another Data Processor) is a programing language that is designed for Web database programing. It is a scripting language and a lightweight programming language in which it is possible to mix SQL easily. It is easy to install. ADP is base on Prolog. But ADP uses only the backtrack and unification. The syntax is original and likes a another scripting language, supports method call.
    Downloads: 12 This Week
    Last Update:
    See Project
  • 3

    s(ASP)

    Implements the stable model semantics without grounding.

    s(ASP) is an implementation of the stable model semantics of logic programming. Unlike similar systems, it does not employ any form of grounding. This allows s(ASP) to execute programs that are not finitely groundable, including those which make use of lists and terms. Work on s(ASP) is supported by the National Science Foundation under Grant No. 1423419. Details of how s(ASP) works can be found in the following paper: Marple, Kyle, Elmer Salazar, and Gopal Gupta. "Computing Stable Models of Normal Logic Programs Without Grounding." arXiv preprint arXiv:1709.00501 (2017) (https://arxiv.org/abs/1709.00501).
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
MongoDB Logo MongoDB