Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Donald Ringe

dblp:04/404 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3Artificial intelligence and machine learning · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › phylogenetics
evolutionary history reconstruction
0.011996
Reconstructing the Evolutionary History of Natural Languages · SODA 1996
Bioinformatics and computational biology
phylogenetics
0.011996
Reconstructing the Evolutionary History of Natural Languages · SODA 1996
YearPublicationVenuePosition
2007 Inferring Phylogenetic Trees Using Answer Set Programming
Daniel R. Brooks, Esra Erdem 0001, Selim T. Erdogan, James W. Minett, Donald Ringe
J. Autom. Reason.5
2006 Temporal phylogenetic networks and logic programming
abstract
The concept of a temporal phylogenetic network is a mathematical model of evolution of a family of natural languages. It takes into account the fact that languages can trade their characteristics with each other when linguistic communities are in contact, and also that a contact is only possible when the languages are spoken at the same time. We show how computational methods of answer set programming and constraint logic programming can be used to generate plausible conjectures about contacts between prehistoric linguistic communities, and illustrate our approach by applying it to the evolutionary history of Indo-European languages.
Esra Erdem 0001, Vladimir Lifschitz, Donald Ringe
Theory Pract. Log. Program.3
2005 Character-Based Cladistics and Answer Set Programming
Daniel R. Brooks, Esra Erdem 0001, James W. Minett, Donald Ringe
PADL4
2003 Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming
Esra Erdem 0001, Vladimir Lifschitz, Luay Nakhleh, Donald Ringe
PADL4
1996 Reconstructing the Evolutionary History of Natural Languages
Tandy J. Warnow, Donald Ringe, Ann Taylor
SODA2