Towards the Implementation of Functions in the DLV System

Title: Towards the Implementation of Functions in the DLV System

Abstract: This research article discusses the implementation of functions in the DLV system, a powerful logic programming system. It provides a language specification and addresses the main implementation issues, including rewriting rules and ordering bodies.

Research Question: How can functions be implemented effectively in the DLV system?

Methodology: The study proposes a method for implementing functions in the DLV system by "flattening" them into special built-in predicates. These predicates have the same arity as the original function, and all terms remain the same, except for the first argument, which is an identifier that links the new predicate symbol to the ones that contain the original function.

Results: The research demonstrates that this method allows for efficient implementation of functions, improves readability of rules, and ensures proper handling of negations and aggregates.

Implications: The proposed method for implementing functions in the DLV system can lead to better performance and increased flexibility. It also provides a clear and consistent approach to handling functions, making the system more user-friendly and easier to maintain.

In conclusion, the research provides a practical and effective solution for implementing functions in the DLV system, which can be beneficial for various logic programming applications.

Link to Article: https://arxiv.org/abs/0404012v1 Authors: arXiv ID: 0404012v1