Problem solving in ID-logic with aggregates: some experiments

TL;DR

This paper explores the integration of high-order aggregates into ID-logic, enhancing its expressive power for declarative knowledge representation and analyzing the impact on the SLDNFA solver's performance.

Contribution

It introduces high-order aggregates into ID-logic and examines their effects on the SLDNFA solver, advancing logic programming for complex problem solving.

Findings

Successful integration of high-order aggregates into ID-logic

Impacts on the SLDNFA solver's behavior and performance

Enhanced expressiveness for declarative problem specifications

Abstract

The goal of the LP+ project at the K.U.Leuven is to design an expressive logic, suitable for declarative knowledge representation, and to develop intelligent systems based on Logic Programming technology for solving computational problems using the declarative specifications. The ID-logic is an integration of typed classical logic and a definition logic. Different abductive solvers for this language are being developed. This paper is a report of the integration of high order aggregates into ID-logic and the consequences on the solver SLDNFA.