Proceedings of the eleventh international conference on Logic programming
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Omega-Restricted Logic Programs
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Strong and Weak Constraints in Disjunctive Datalog
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Diagnostic reasoning with A-Prolog
Theory and Practice of Logic Programming
Probabilistic reasoning with answer sets
Theory and Practice of Logic Programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Weight Constraint Programs with Functions
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A decidable subclass of finitary programs
Theory and Practice of Logic Programming
Functional answer set programming
Theory and Practice of Logic Programming
Functional stable model semantics and answer set programming modulo theories
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
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
Answer set programming modulo theories and reasoning about continuous changes
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) by non-Herbrand functions, i.e. functions over non-Herbrand domains. Introducing support for such functions allows for an economic and natural representation of certain kinds of knowledge that are comparatively cumbersome to represent in ASP. The key difference between our approach and other techniques for the support of non-Herbrand functions is that our extension is more "conservative" from a knowledge representation perspective. In fact, we purposefully designed the new language so that (1) the representation of relations is fully retained; (2) the representation of knowledge using non-Herbrand functions follows in a natural way from the typical ASP strategies; (3) the semantics is an extension of the the semantics of ASP from [9], allowing for a comparatively simple incorporation of various extensions of ASP such as weak constraints, probabilistic constructs and consistency-restoring rules.