Models and Algorithms for Chronology

Authors Gilles Geeraerts, Eythan Levy, Frédéric Pluquet



PDF
Thumbnail PDF

File

LIPIcs.TIME.2017.13.pdf
  • Filesize: 0.62 MB
  • 18 pages

Document Identifiers

Author Details

Gilles Geeraerts
Eythan Levy
Frédéric Pluquet

Cite AsGet BibTex

Gilles Geeraerts, Eythan Levy, and Frédéric Pluquet. Models and Algorithms for Chronology. In 24th International Symposium on Temporal Representation and Reasoning (TIME 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 90, pp. 13:1-13:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.TIME.2017.13

Abstract

The last decades have seen the rise of many fundamental chronological debates in Old World archaeology, with far-reaching historical implications. Yet, outside of radiocarbon dating - where Bayesian formal tools and models are applied - these chronological debates are still relying on non-formal models, and dates are mostly derived by hand, without the use of mathematical or computational tools, albeit the large number of complex constraints to be taken into account. This article presents formal models and algorithms for encoding archaeologically-relevant chronological constraints, computing optimal chronologies in an automated way, and automatically checking for chronological properties of a given model.
Keywords
  • Chronology
  • Algorithms
  • Archaeology
  • Formal methods

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Rajeev Alur and David L. Dill. A theory of timed automata. Theor. Comput. Sci., 126(2):183-235, 1994. URL: http://dx.doi.org/10.1016/0304-3975(94)90010-8.
  2. Gerd Behrmann, Alexandre David, and Kim G. Larsen. A tutorial on Uppaal. In Formal Methods for the Design of Real-Time Systems: 4th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM-RT 2004, volume 3185 of Lecture Notes in Computer Science, pages 200-236. Springer, September 2004. Google Scholar
  3. Johan Bengtsson. Clocks, DBM, and States in Timed Systems. PhD thesis, Uppsala University, 2002. Google Scholar
  4. Johan Bengtsson and Wang Yi. Timed automata: Semantics, algorithms and tools. In Lectures on Concurrency and Petri Nets, Advances in Petri Nets, volume 3098 of Lecture Notes in Computer Science, pages 87-124. Springer, 2003. URL: http://dx.doi.org/10.1007/978-3-540-27755-2_3.
  5. Patricia Bouyer, Maximilien Colange, and Nicolas Markey. Symbolic optimal reachability in weighted timed automata. In CAV'16, volume 9779 of LNCS, pages 513-530. Springer, 2016. URL: http://dx.doi.org/10.1007/978-3-319-41528-4.
  6. David L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Automatic Verification Methods for Finite State Systems, International Workshop, Grenoble, France, June 12-14, 1989, Proceedings, volume 407 of Lecture Notes in Computer Science, pages 197-212. Springer Verlag, 1989. URL: http://dx.doi.org/10.1007/3-540-52148-8_17.
  7. E. C. Harris. Principles of Archaeological Stratigraphy. Academic Press, New York. NY, 1979. Google Scholar
  8. Felix Höflmayer. The date of the Minoan Santorini eruption: Quantifying the "offset". Radiocarbon, 54:435-448, 2012. Google Scholar
  9. Mads Kähler Holst. Complicated relations and blind dating: Formal analysis of relative chronological structures. In Caitlin E. Buck and Andrew R. Millard, editors, Tools for Constructing Chronologies, pages 129-147. Springer, London, 2004. Google Scholar
  10. Donald B. Johnson. Efficient algorithms for shortest paths in sparse networks. J. ACM, 24(1):1-13, 1977. URL: http://dx.doi.org/10.1145/321992.321993.
  11. Alfred H. Kromholz. Business and industry in archaeology. In Paul Ahström, editor, High, Middle or Low? (Part 1), pages 119-137. Paul Ahströms Förlag, Gothenburg, 1987. Google Scholar
  12. A. Madkour, W. G. Aref, F. U. Rehman, M. Abdur Rahman, and S. Basalamah. A Survey of Shortest-Path Algorithms. Technical Report CoRR abs/1705.02044, Cornell University Library, arXiv.org, 2017. URL: https://arxiv.org/abs/1705.02044.
  13. Amihai Mazar. The debate over the chronology of the Iron Age in the southern Levant. In The Bible and Radiocarbon Dating, Archaeology, Text and Science, pages 15-30, 2005. Google Scholar
  14. Itay Meiri. Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence, 87(1):343-385, 1996. URL: http://dx.doi.org/10.1016/0004-3702(95)00109-3.
  15. Christopher Bronk Ramsey. Radiocarbon calibration and analysis of stratigraphy: the OxCal program. Radiocarbon, 37(2):425-430, 1995. Google Scholar
  16. Ilan Sharon. Partial order scalogram analysis of relations - a mathematical approach to the analysis of stratigraphy. Journal of Archaeological Science, 22:751-767, 1995. Google Scholar
  17. Robert E. Shostak. Deciding linear inequalities by computing loop residues. J. ACM, 28(4):769-779, 1981. URL: http://dx.doi.org/10.1145/322276.322288.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail