Logic programming applications: what are the abstractions and implementations?

Abstract

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.the introduction of non-declarative features in logic languages and resulted in the writing of obscure logic programs.Despite the challenges, the most exciting aspect of logic programming is its vast areas of applications. They range from database queries to program analysis, from text processing to decision making, from security to knowledge engineering, and more. These vast, complex, and interrelated areas make it challenging but necessary to provide a deeper understanding of the various kinds of applications in order to help advance the state of the art of logic programming and realize its benefits.This article presents an overview of applications of logic programming based on a study of the abstractions and implementations of logic languages. The rationale is that abstractions and implementations are the enabling technologies of the applications. The abstractions are essential for determining what kinds of application problems can be expressed and how they can be expressed, for ease of understanding, reuse, and maintenance. The underlying implementations are essential for high-level declarative languages to be sufficiently efficient for substantial applications.We discuss the following essential abstractions, where data abstractions are for expressing the data, and control abstractions are for expressing computations over the data:1. data abstractions: objects and relationships; 2. control abstractions: (1) join, (2) recursion, and (3) constraint, which capture bounded, cyclic, and general computations, respectively. Logic language abstractionsLogic languages provide very high-level data and control abstractions, using mostly very simple language constructs. We describe these abstractions and their meanings intuitively. Data abstractionsAll data in logic languages are abstracted, essentially, as objects and relationships.

Scale to estimate the aspect-oriented sentiment polarity under anaphors influence (SPAI)

“…Concerning this, the proposed method determines and binds the related antecedent of the corresponding pronoun of the input statement. Concerning this, the proposed method performs backtrack propagation (Liu, 2018; Wu et al , 2019) on one or more previous sentences of the corresponding input sentence. The anaphora resolution of the aspects shall perform as follows.…”

Recursive Rules with Aggregation: A Simple Unified Semantics

“…Many computation problems, including complex reasoning problems in particular, such as program analysis, networking, and decision support, are most clearly and easily specified using logical rules [39]. However, such reasoning problems in practical applications, especially for large applications and when faced with uncertain situations, require the use of recursive rules with aggregation such as counts and sums.…”