Datalog extensions for database queries and updates
Journal of Computer and System Sciences
Proceedings of the eleventh international conference on Logic programming
The expressive power of stratified logic programs with value invention
Information and Computation
Extending and implementing the stable model semantics
Artificial Intelligence
ILOG: Declarative Creation and Manipulation of Object Identifiers
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Omega-Restricted Logic Programs
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Expressiveness of Semipositive Logic Programs with Value Invention
LID '96 Proceedings of the International Workshop on Logic in Databases
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Theory and Practice of Logic Programming
Reasoning with infinite stable models
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A uniform integration of higher-order reasoning and external evaluations in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
External sources of computation for answer set solvers
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Nonmonotonic ontological and rule-based reasoning with extended conceptual logic programs
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
| Hi-index | 0.00 |
The issue of value invention in logic programming embraces many scenarios, such as logic programming with function symbols, object oriented logic languages, inter-operability with external sources of knowledge, set unification. This paper introduces a framework embedding value invention in a general context. The class of programs having a suitable (but, in general, not decidable) ‘finite grounding property' is identified, and the class of ‘value invention restricted' programs is introduced. Value invention restricted programs have the finite grounding property and can be decided in polynomial time. They are, in a sense, the broadest polynomially decidable class having this property, whenever no assumption can be made about the nature of invented values (while this latter is the case in the specific literature about logic programming with function symbols). Relationships with existing formalisms are eventually discussed; in particular, value invention restricted programs subsume ω-restricted programs and are incomparable with finitary programs.