Theory and Practice of Logic Programming

Papers
(The TQCC of Theory and Practice of Logic Programming is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-05-01 to 2026-05-01.)
ArticleCitations
The Stable Model Semantics of Datalog with Metric Temporal Operators28
Towards Probabilistic Inductive Logic Programming with Neurosymbolic Inference and Relaxation18
Towards Industrial-Scale Product Configuration17
An ASP Approach for Reasoning on Neural Networks under a Finitely Many-Valued Semantics for Weighted Conditional Knowledge Bases17
Smart Expansion Techniques for ASP-Based Interactive Configuration10
Winning Snake: Design Choices in Multi-Shot ASP10
Preface to the Special Issue on the 2022 Conference on Logic Programming and Nonmonotonic Reasoning10
A CASP-Based Solution for Traffic Signal Optimisation10
Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers From the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022)9
Introduction to the 38th International Conference on Logic Programming Special Issue II9
Interactive Model Expansion in an Observable Environment8
An ASP Framework for the Refinement of Authorization and Obligation Policies8
Introduction to the 39th International Conference on Logic Programming Special Issue6
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory6
Swift Markov Logic for Probabilistic Reasoning on Knowledge Graphs6
“What if?” in Probabilistic Logic Programming5
Optimal Matching for Sharing and Linearity Analysis5
Implementing Backjumping by Means of Exception Handling5
Probabilistic Answer Set Programming with Discrete and Continuous Random Variables5
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations5
Evaluating Datalog Tools for Meta-reasoning over OWL 2 QL4
Making ProB Compatible with SWI-Prolog4
A General Framework for Dynamic MAPF Using Multi-Shot ASP and Tunnels4
Autonomous Agents and Policy Compliance: A Framework for Reasoning About Penalties4
The Collection of Papers Celebrating the 20th Anniversary of TPLP, Part II4
Comparing Non-Minimal Semantics for Disjunction in Answer Set Programming3
The Semantics of Metaprogramming in Prolog3
A Novel Framework for Systematic Propositional Formula Simplification Based on Existential Graphs3
Practical Reasoning in DatalogMTL3
Abstract Argumentation and Answer Set Programming: Two Faces of Nelson’s Logic3
An Application of a Runtime Epistemic Probabilistic Event Calculus to Decision-making in e-Health Systems3
Fifty Years of Prolog and Beyond3
FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data3
Extended High-Utility Pattern Mining: An Answer Set Programming-Based Framework and Applications3
Unifying Framework for Optimizations in Non-Boolean Formalisms3
On Establishing Robust Consistency in Answer Set Programs2
Property-Based Testing by Elaborating Proof Outlines2
Knowledge Authoring for Rules and Actions2
On Systematic Construction of Correct Logic Programs2
Selected Papers from Datalog 2.0 20222
On the Equivalence between Logic Programming and SETAF2
Toward A Logical Theory Of Fairness and Bias2
Model Explanation via Support Graphs2
Locksynth: Deriving Synchronization Code for Concurrent Data Structures with ASP2
Integrating Belief Domains into Probabilistic Logic Programs2
Introduction to the Collection of Papers Celebrating the 20th Anniversary of TPLP2
Inductive Learning for Possibilistic Logic Programs Under Stable Models2
Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers from the 4th International Joint Conference on Rules and Reasoning (RuleML+RR 2020)2
The Power of Negation in Higher-Order Datalog2
Plingo: A System for Probabilistic Reasoning in Answer Set Programming2
Historical Review of Variants of Informal Semantics for Logic Programs under Answer Set Semantics: GL’88, GL’91, GK’14, D-V’122
Hiord $^{{\kern2pt}\sharp}$ : An Approach to the Specification and Verification of Higher-Order (C)LP Programs2
Compositional Verification in Rewriting Logic2
0.056548833847046