Abstract
The traditional semantics for relational logic (sometimes called Tarskian semantics) is based on the notion of interpretations of constants in terms of objects external to the logic. Herbrand semantics is an alternative that is based on truth assignments for ground sentences without reference to external objects. Herbrand semantics is simpler and more intuitive than Tarskian semantics; and, consequently, it is easier to teach and learn. Moreover, it is stronger than Tarskian semantics. For example, while it is not possible to finitely axiomatize integer arithmetic with Tarskian semantics, this can be done easily with Herbrand semantics. The downside is a loss of some common logical properties, such as compactness and inferential completeness. However, there is no loss of inferential power—anything that can be deduced according to Tarskian semantics can also be deduced according to Herbrand semantics. Based on these results, we argue that there is value in using Herbrand semantics for relational logic in place of Tarskian semantics. It alleviates many of the current problems with relational logic and ultimately may foster a wider use of relational logic in human reasoning and computer applications.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chandra, A.K., Harel, D.: Horn clause queries and generalizations. The Journal of Logic Programming 2(1), 1–15 (1985)
Genesereth, M., Kao, E.: Introduction to Logic, Synthesis Lectures on Computer Science, vol. 4. Morgan & Claypool Publishers, 2 edn. January 2013. http://www.morganclaypool.com/doi/abs/10.2200/S00432ED1V01Y201207CSL005
Genesereth, M., Kao, E.J.Y.: Herbrand semantics. Tech. Rep. LG-2015-01, Logic Group, Computer Science Dept., Stanford University (2015). http://logic.stanford.edu/herbrand/herbrand.html
Goubault-Larrecq, J., Mackie, I.: Proof theory and automated deduction. Applied Logic Series, 1st edn. Springer, Netherlands (1997)
Keller, U.: Some remarks on the definability of transitive closure in first-order logic and datalog. Tech. rep, Digital Enterprise Research Institute (DERI) (2004)
Van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. Journal of the ACM (JACM) 23(4), 733–742 (1976)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Genesereth, M., Kao, E. (2015). The Herbrand Manifesto. In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds) Rule Technologies: Foundations, Tools, and Applications. RuleML 2015. Lecture Notes in Computer Science(), vol 9202. Springer, Cham. https://doi.org/10.1007/978-3-319-21542-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-21542-6_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21541-9
Online ISBN: 978-3-319-21542-6
eBook Packages: Computer ScienceComputer Science (R0)