Full-text

URL: http://www.cs.rice.edu/~nakhleh/Papers/padl03.pdf

Cached: PDF-233K

SAVE AS an easy-to-recall long filename:

Filename format: author--year--title   PDF-233K

Filename format: author--year--title--journal|proceedings|...--pages   PDF-233K

Related links

Source: http://www.cs.rice.edu/~nakhleh/CPHL/

Web search: Google Web Search   ::   Google Scholar

Within this site: Cited by (3)

Abstract

The evolutionary history of languages can be modeled as a tree, called a phylogeny, where the leaves represent the extant lan- guages, 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 com- puting 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 tech- niques, we have generated a few conjectures regarding the evolution of Indo-European languages.

@inproceedings{erdem03PADL,
  author={E. Erdem and V. Lifschitz and L. Nakhleh and D. Ringe},
  title={Reconstructing the evolutionary history of Indo-European languages using answer set programming},
  year={2003},
  booktitle={Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages (PADL 03)},
  url={http://www.isrl.uiuc.edu/~amag/langev/paper/erdem03PADL.html}
}

HOME   ::  Conference List   ::   Conference Paper	Comments to: junwang4 you-know-at gmail.com	Last update: 10/27/09