- home
- Advanced Search
Filters
Clear All- Digital Humanities and Cultural Heritage
- Publications
- Austrian Science Fund (FWF)
- General Purpose Database of Knowled...
- Digital Humanities and Cultural Heritage
- Publications
- Austrian Science Fund (FWF)
- General Purpose Database of Knowled...
Loading
description Publicationkeyboard_double_arrow_right Article 2006Publisher:Cambridge University Press (CUP) Funded by:NSF | General Purpose Database ..., NSF | Bayesian Rectification of..., FWF | An ASP Framework for Reac...NSF| General Purpose Database of Knowledge about Actions ,NSF| Bayesian Rectification of Nonlinear Dynamic Chemical Process Systems ,FWF| An ASP Framework for Reactive Planning and MonitoringAuthors: Erdem, Esra; Lifschitz, Vladimir; Ringe, Don;Erdem, Esra; Lifschitz, Vladimir; Ringe, Don;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. To appear in Theory and Practice of Logic Programming (TPLP).
Theory and Practice ... arrow_drop_down arXiv.org e-Print ArchiveOther literature type . Preprint . 2005Data sources: arXiv.org e-Print ArchiveTheory and Practice of Logic ProgrammingArticle . 2006 . Peer-reviewedLicense: Cambridge Core User AgreementData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2005License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1017/s1471068406002729&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen bronze 22 citations 22 popularity Average influence Top 10% impulse Top 10% Powered by BIP!more_vert Theory and Practice ... arrow_drop_down arXiv.org e-Print ArchiveOther literature type . Preprint . 2005Data sources: arXiv.org e-Print ArchiveTheory and Practice of Logic ProgrammingArticle . 2006 . Peer-reviewedLicense: Cambridge Core User AgreementData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2005License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1017/s1471068406002729&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu
Loading
description Publicationkeyboard_double_arrow_right Article 2006Publisher:Cambridge University Press (CUP) Funded by:NSF | General Purpose Database ..., NSF | Bayesian Rectification of..., FWF | An ASP Framework for Reac...NSF| General Purpose Database of Knowledge about Actions ,NSF| Bayesian Rectification of Nonlinear Dynamic Chemical Process Systems ,FWF| An ASP Framework for Reactive Planning and MonitoringAuthors: Erdem, Esra; Lifschitz, Vladimir; Ringe, Don;Erdem, Esra; Lifschitz, Vladimir; Ringe, Don;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. To appear in Theory and Practice of Logic Programming (TPLP).
Theory and Practice ... arrow_drop_down arXiv.org e-Print ArchiveOther literature type . Preprint . 2005Data sources: arXiv.org e-Print ArchiveTheory and Practice of Logic ProgrammingArticle . 2006 . Peer-reviewedLicense: Cambridge Core User AgreementData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2005License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1017/s1471068406002729&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen bronze 22 citations 22 popularity Average influence Top 10% impulse Top 10% Powered by BIP!more_vert Theory and Practice ... arrow_drop_down arXiv.org e-Print ArchiveOther literature type . Preprint . 2005Data sources: arXiv.org e-Print ArchiveTheory and Practice of Logic ProgrammingArticle . 2006 . Peer-reviewedLicense: Cambridge Core User AgreementData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2005License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1017/s1471068406002729&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu