Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
External sources of knowledge and value invention in logic programming
Annals of Mathematics and Artificial Intelligence
External sources of computation for answer set solvers
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
A 25-year perspective on logic programming
Logic programming, knowledge representation, and nonmonotonic reasoning
Automata for infinite argumentation structures
Artificial Intelligence
Hi-index | 0.00 |
We present DLV-Complex, an extension of the DLV system that features the support for a powerful (possibly recursive) use of functions, list and set terms in the full ASP language with disjunction and negation. Any computable function can be encoded in a rich and fully declarative KRR language, ensuring termination on all programs belonging to the recently introduced class of finitely-ground programs; furthermore, termination can be "a priori" guaranteed on demand by means of a syntactic restriction check that ensures a finite-domain property. The system, which is already successfully used in many universities and research institutes, comes also equipped with a rich library of built-in functions and predicates for the manipulation of complex terms.