Results 11 to 20 of about 936 (67)

Pengines: Web Logic Programming Made Easy [PDF]

open access: yesTheory and Practice of Logic Programming 14 (2014) 539-552, 2014
When developing a (web) interface for a deductive database, functionality required by the client is provided by means of HTTP handlers that wrap the logical data access predicates. These handlers are responsible for converting between client and server data representations and typically include options for paginating results.
arxiv   +1 more source

Java Prolog Interface [PDF]

open access: yesarXiv, 2022
There are many initiatives in presents-days for interaction between Java and Prolog programming languages. These initiatives allow combine two programming paradigms, Object Oriented Programming and Logic Programming. Every proposed interface has specifics features depending of the final use.
arxiv  

Exploring an LM to generate Prolog Predicates from Mathematics Questions [PDF]

open access: yesarXiv, 2023
Recently, there has been a surge in interest in NLP driven by ChatGPT. ChatGPT, a transformer-based generative language model of substantial scale, exhibits versatility in performing various tasks based on natural language. Nevertheless, large language models often exhibit poor performance in solving mathematics questions that require reasoning.
arxiv  

Planning for an Efficient Implementation of Hypothetical Bousi~Prolog [PDF]

open access: yesarXiv, 2021
This paper explores the integration of hypothetical reasoning into an efficient implementation of the fuzzy logic language Bousi~Prolog. To this end, we first analyse what would be expected from a logic inference system, equipped with what is called embedded implication, to model solving goals with respect to assumptions.
arxiv  

Value Withdrawal Explanation in CSP [PDF]

open access: yesarXiv, 2000
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, constraint solving amounts to domain reduction. A computation is formalized by a chaotic iteration. The computed result is described as a closure.
arxiv  

CLPGUI: a generic graphical user interface for constraint logic programming over finite domains [PDF]

open access: yesarXiv, 2002
CLPGUI is a graphical user interface for visualizing and interacting with constraint logic programs over finite domains. In CLPGUI, the user can control the execution of a CLP program through several views of constraints, of finite domain variables and of the search tree.
arxiv  

Efficient Compression of Prolog Programs [PDF]

open access: yesarXiv, 2006
We propose a special-purpose class of compression algorithms for efficient compression of Prolog programs. It is a dictionary-based compression method, specially designed for the compression of Prolog code, and therefore we name it PCA (Prolog Compression Algorithm).
arxiv  

Design and Implementation of a Tracer Driver: Easy and Efficient Dynamic Analyses of Constraint Logic Programs [PDF]

open access: yesarXiv, 2008
Tracers provide users with useful information about program executions. In this article, we propose a ``tracer driver''. From a single tracer, it provides a powerful front-end enabling multiple dynamic analysis tools to be easily implemented, while limiting the overhead of the trace generation.
arxiv  

Using Prolog for Transforming XML Documents [PDF]

open access: yesarXiv, 2019
Proponents of the programming language Prolog share the opinion Prolog is more appropriate for transforming XML-documents as other well-established techniques and languages like XSLT. In order to clarify this position this work proposes a tuProlog-styled interpreter for parsing XML-documents into Prolog-internal lists and vice versa for serialising ...
arxiv  

Drawing Prolog Search Trees: A Manual for Teachers and Students of Logic Programming [PDF]

open access: yesarXiv, 2020
Programming in Prolog is hard for programmers that are used to procedural coding. In this manual the method of drawing search trees is introduced with the aim to get a better understanding of how Prolog works. After giving a first example of a Prolog database, query and search tree, the art of drawing search trees is systematically introduced giving ...
arxiv  

Home - About - Disclaimer - Privacy