Search Results for "can"

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.

...It naturally supports model-level activities, such as constraints (extending UML diagrams), dynamic compositional modeling, analysis and reasoning about models, model testing, design pattern modeling, specification of Domain Specific Modeling Languages, and meta-modeling. FOML can reason about: 1. The model meta-data (meta-model level reasoning, or syntax reasoning) 2. Data level: reason about a model and its data (instance model, i.e., diagram) FOML is built as a semantic layer on top of PathLP - a compact logic rule language of guarded path expressions, an adaptation of a subset of F-logic.

...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).

C#Prolog -- A Prolog interpreter written in C#. Can easily be integrated in C# programs. Characteristics: reliable and fairly fast interpreter, command line interface, Windows-interface, builtin DCG, XML- and JSON-predicates, SQL-predicates, extendible.