Flattening and Saturation: Two Representation Changes for Generalization
Machine Learning - Special issue on evaluating and changing representation
Omega-Restricted Logic Programs
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Algebraic Semantics for Functional Logic Programming with Polymorphic Order-Sorted Types
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Reasoning with infinite stable models
Artificial Intelligence
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A characterization of strong equivalence for logic programs with variables
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
FDNC: decidable non-monotonic disjunctive logic programs with function symbols
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Functional answer set programming
Theory and Practice of Logic Programming
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
FQHT: the logic of stable models for logic programs with intensional functions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
In this paper we propose an extension of Answer Set Programming (ASP) [1], and in particular, of its most general logical counterpart, Quantified Equilibrium Logic (QEL) [2], to deal with partial functions. Although the treatment of equality in QEL can be established in different ways, we first analyse the choice of decidable equality with complete functions and Herbrand models, recently proposed in the literature [3]. We argue that this choice yields some counterintuitive effects from a logic programming and knowledge representation point of view. We then propose a variant called where the set of functions is partitioned into partial and Herbrand functions (we also call constructors ). In the rest of the paper, we show a direct connection to Scott's Logic of Existence [4] and present a practical application, proposing an extension of normal logic programs to deal with partial functions and equality, so that they can be translated into function-free normal programs, being possible in this way to compute their answer sets with any standard ASP solver.