Temporal phylogenetic networks and logic programming

DOI10.1017/S1471068406002729MaRDI QIDQ5482276zbMATH OpenFDO

Authors Esra Erdem, Vladimir Lifschitz, Don Ringe

Publication date 28 August 2006

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

phylogeneticsanswer set programmingconstraint logic programminghistorical linguisticsindo-European languages

Mathematics Subject Classification ID

Logic programming (68N17) Natural language processing (68T50)

Recommendations

• scientific article; zbMATH DE number 1954109
• Mathematical approaches to comparative linguistics
• Inferring phylogenetic trees using answer set programming
• Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
• UNRAVELING THE TANGLES OF LANGUAGE EVOLUTION

Cited in

(9)

• Orchard networks are trees with additional horizontal arcs
• Constructing Camin-Sokal Phylogenies Via Answer Set Programming
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Logic programs with abstract constraint atoms: the role of computations
• Dated Ancestral Trees from Binary Trait Data and Their Application to the Diversification of Languages
• Justifications for logic programs under answer set semantics
• Finding similar/diverse solutions in answer set programming
• Inferring phylogenetic trees using answer set programming
• scientific article; zbMATH DE number 1954109 (Why is no real title available?)

Describes a project that uses

Uses Software

• ASSAT

This page was built for publication: Temporal phylogenetic networks and logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5482276)