Abstract
The evolutionary history of languages can be modeled as a tree, called a phylogeny, where the leaves represent the extant languages, the internal vertices represent the ancestral languages, and the edges represent the genetic relations between the languages. Languages not only inherit characteristics from their ancestors but also sometimes borrow them from other languages. Such borrowings can be represented by additional non-tree edges. This paper addresses the problem of computing a small number of additional edges that turn a phylogeny into a “perfect phylogenetic network”. To solve this problem, we use answer set programming, which represents a given computational problem as a logic program whose answer sets correspond to solutions. Using the answer set solver smodels, with some heuristics and optimization techniques, we have generated a few conjectures regarding the evolution of Indo-European languages.
This is a preview of subscription content, log in via an institution to check access.
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
Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert Kowalski and Kenneth Bowen, editors, Logic Programming: Proc. Fifth Int’l Conf. and Symp., pages 1070–1080, 1988.
Michael Gelfond and Vladimir Lifschitz. Logic programs with classical negation. In David Warren and Peter Szeredi, editors, Logic Programming: Proc. Seventh Int’l Conf., pages 579–597, 1990.
Vladimir Lifschitz. Answer set programming and plan generation. Artificial Intelligence, 138:39–54, 2002.
V.H. Mair, editor. The Bronze Age and Early Iron Age Peoples of Eastern Central Asia. Institute for the Study of Man, Washington, 1998.
J.P. Mallory. In Search of the Indo-Europeans. Thames and Hudson, London, 1989.
Victor Marek and Miroslaw Truszczyński. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective, pages 375–398. Springer Verlag, 1999.
L. Nakhleh, D. Ringe, and T. Warnow. Perfect phylogenetic networks: A new methodology for reconstructing the evolutionary history of natural languages. Unpublished manuscript, 2002.
Ilkka Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Arti.cial Intelligence, 25:241–273, 1999.
Ilkka Niemelä and Patrik Simons. Extending the Smodel system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Arti.cial Intelligence.Kluwer, 2000.
D. Ringe, T. Warnow, and A. Taylor. Indo-European and computational cladistics. Transactions of the Philological Society, 100(1):59–129, 2002.
R.G. Roberts, R. Jones, and M.A. Smith. Thermoluminescence dating of a 50,000-year-old human occupation site in Northern Australia. Science, 345:153–156, 1990.
Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138:181–234, 2002.
Tommi Syrjänen. Omega-restricted logic programs. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 2001.
Tommi Syrjänen. Lparse 1.0 user’s manual,5 2002.
J.P. White and J.F. O’Connell. A Prehistory of Australia, New Guinea, and Sahul. Academic Press, New York, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erdem, E., Lifschitz, V., Nakhleh, L., Ringe, D. (2003). Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming. In: Dahl, V., Wadler, P. (eds) Practical Aspects of Declarative Languages. PADL 2003. Lecture Notes in Computer Science, vol 2562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36388-2_12
Download citation
DOI: https://doi.org/10.1007/3-540-36388-2_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00389-2
Online ISBN: 978-3-540-36388-0
eBook Packages: Springer Book Archive