Logic Programming Applications: What Are the Abstractions and Implementations?

2018-02-20 · Yanhong A. Liu

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.

📄 PDF Abstract BibTeX arXiv:1802.07284

Code (0)

등록된 구현이 없습니다.

Iris: First-Class Multi-GPU Programming Experience in Triton

2025-11-16 · Muhammad Awad, Muhammad Osama, Brandon Potter arxiv

Multi-GPU programming traditionally requires developers to navigate complex trade-offs between performance and programmability. High-performance implementations typically rely on low-level HIP/CUDA communication librarie…

Phyelds: A Pythonic Framework for Aggregate Computing

2026-03-31 · Gianluca Aguzzi, Davide Domini, Nicolas Farabegoli, Mirko Viroli arxiv

Aggregate programming is a field-based coordination paradigm with over a decade of exploration and successful applications across domains including sensor networks, robotics, and IoT, with implementations in various prog…

Multi-agent Reinforcement Learning Federated Learning

Learning logic programs by discovering higher-order abstractions

2023-08-16 · Céline Hocquette, Sebastijan Dumančić, Andrew Cropper

We introduce the higher-order refactoring problem, where the goal is to compress a logic program by discovering higher-order abstractions, such as map, filter, and fold. We implement our approach in Stevie, which formula…

Inductive logic programming Program Synthesis Visual Reasoning

Answer-Set-Programming-based Abstractions for Reinforcement Learning

2026-05-29 · Rafael Bankosegger, Thomas Eiter, Johannes Oetsch arxiv

Reinforcement Learning (RL) enables autonomous agents to learn policies from experience, but realistic problems often involve enormous state spaces, making learning and generalisation challenging. Abstraction and approxi…

Reinforcement Learning

Streaming Tensor Programs: A Streaming Abstraction for Dynamic Parallelism

2025-11-11 · Gina Sohn, Genghan Zhang, Konstantin Hossfeld, Jungwoo Kim 외 arxiv

Dynamic behaviors are becoming prevalent in tensor applications, like machine learning, where many widely used models contain data-dependent tensor shapes and control flow. However, the limited expressiveness of prior pr…