Abstract
In this work we reconsider the replacement of predicate-like notation by functional terms, using a similar syntax to Functional Logic Programming, but under a completely different semantic perspective. Our starting point comes from the use of logic programs for Knowledge Representation and Nonmonotonic Reasoning, especially under three well-known semantics for default negation: Clark’s completion, stable models and well-founded semantics. The motivation for introducing functions in this setting arises from the frequent occurrence of functional dependences in the representation of many domains. The use of functions allows us to avoid explicit axiomatization and provides a more compact representation by nesting functional terms. From a representational point of view, the most interesting introduced feature is the possibility of replacing default negation by the concept of default value of a function. In the paper, we explore this idea of functions with default values, providing adapted versions of the three mentioned semantics for the functional case, and equivalent translations into logic programs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Databases, pp. 241–327. Plenum, New York (1978)
Geffner, H.: Functional STRIPS: a more flexible language for planning and problem solving. In: Logic-Based Artificial Intelligence, Kluwer, Dordrecht (2000)
Gelfond, M., Lifschitz, V.: The stable models semantics for logic programming. In: Proc. of the 5th Intl. Conf. on Logic Programming, pp. 1070–1080 (1988)
Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artificial Intelligence Journal 153, 49–104 (2004)
Hanus, M.: The integration of functions into logic programming: from theory to practice. Journal of Logic Programming 19(20), 583–628 (1994)
McCain, N., Turner, H.: Causal theories of action and change. In: Proc. of the AAAI 1997, pp. 460–465 (1997)
Moreno-Navarro, J.J.: Extending constructive negation for partial functions in lazy functional-logic languages. In: Extensions of Logic Programming, pp. 213–227 (1996)
Pereira, L.M., Alferes, J.J.: Well founded semantics for logic programs with explicit negation. In: Proceedings of ECAI 1992, Montreal, Canada, pp. 102–106. John Wiley & Sons, Chichester (1992)
Slagle, J.R.: Automated theorem-proving for theories with simplifiers, commutativity and associativity. Journal of the ACM 21(4), 622–642 (1974)
van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. Journal of the ACM 23, 733–742 (1976)
van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620–650 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cabalar, P., Lorenzo, D. (2004). Logic Programs with Functions and Default Values. In: Alferes, J.J., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2004. Lecture Notes in Computer Science(), vol 3229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30227-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-30227-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23242-1
Online ISBN: 978-3-540-30227-8
eBook Packages: Springer Book Archive