Logic Programming Applications: What Are the Abstractions and Implementations?

02/20/2018
by   Yanhong A. Liu, et al.
0

This article presents an overview of applications of logic programming, classifying them based on the abstractions and implementations of logic languages that support the applications. The three key abstractions are join, recursion, and constraint. Their essential implementations are for-loops, fixed points, and backtracking, respectively. The corresponding kinds of applications are database queries, inductive analysis, and combinatorial search, respectively. We also discuss language extensions and programming paradigms, summarize example application problems by application areas, and touch on example systems that support variants of the abstractions with different implementations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2023

The Logic of Logic Programming

Our position is that logic programming is not programming in the Horn cl...
research
08/16/2023

Learning Logic Programs by Discovering Higher-Order Abstractions

Discovering novel abstractions is important for human-level AI. We intro...
research
08/29/2014

On computable abstractions (a conceptual introduction)

This paper introduces abstractions that are meaningful for computers and...
research
01/26/2022

Fifty Years of Prolog and Beyond

Both logic programming in general, and Prolog in particular, have a long...
research
05/09/2022

Making ProB compatible with SWI-Prolog

Even though the core of the Prolog programming language has been standar...
research
08/04/2022

Proceedings 38th International Conference on Logic Programming

ICLP is the premier international event for presenting research in logic...
research
04/12/2018

Implementing Adaptive Ensemble Biomolecular Applications at Scale

Many scientific problems require multiple distinct computational tasks t...

Please sign up or login with your details

Forgot password? Click here to reset