Satisfiability, Lattices, Temporal Logic and Constraint Logic Programming on Intervals

In Ivo Düntsch & Edwin Mares (eds.), Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs. Springer Verlag. pp. 521-536 (2021)
  Copy   BIBTEX

Abstract

This essay narrates some of the influences that Alasdair Urquhart has had on computer science at the intersection of automated theorem proving, temporal logic and lattice theory—topics that have no obvious relationship to one another. I illustrate this by showing how Allen’s temporal relations are represented in a system for constraint logic programming over intervals and how the combination of a linear-resolution theorem prover and an interval constraint satisfaction system are connected via a lattice-theoretical semantic model. I also speculate on whether some of Thich Nhat Hanh’s meditation teachings might have been one of the sources of Alasdair’s creative inspirations and preternatural capacity for lateral thinking.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,410

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2022-03-09

Downloads
20 (#920,237)

6 months
5 (#897,479)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references