- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Computational complexity of relating time points with intervals
Artificial Intelligence 109 (1-2):273-295 (1999)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Lnint: A Temporal Logic That Combines Points And Intervals And The Absolute And Relative Approaches.Immaculada Perez de Guzman & Carlos Rossi - 1995 - Logic Journal of the IGPL 3 (5):745-764.
Tractability and the computational mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Routledge. pp. 339-353.
Change, Event, and Temporal Points of View.Antti Hautamäki - 2015 - In Margarita Vázquez Campos & Antonio Manuel Liz Gutiérrez (eds.), Temporal Points of View: Subjective and Objective Aspects. Springer Verlag. pp. 197-221.
Some considerations on non-linear time intervals.El?Bieta Hajnicz - 1995 - Journal of Logic, Language and Information 4 (4):335-357.
On the computational complexity of temporal projection, planning, and plan validation.Bernhard Nebel & Christer Bäckström - 1994 - Artificial Intelligence 66 (1):125-160.
Complexity and postmodernism: understanding complex systems.Paul Cilliers - 1998 - New York: Routledge.
Computation models for parameterized complexity.Marco Cesati & Miriam Dilanni - 1997 - Mathematical Logic Quarterly 43 (2):179-202.
Effects of stimulus complexity on the perception of brief temporal intervals.H. R. Schiffman & Douglas J. Bobko - 1974 - Journal of Experimental Psychology 103 (1):156.
Approximation to measurable functions and its relation to probabilistic computation.Ker-I. Ko - 1986 - Annals of Pure and Applied Logic 30 (2):173-200.
Decidability and complexity of event detection problems for ODEs.Keijo Ruohonen - 1997 - Complexity 2 (6):41-53.
On the complexity of finding paths in a two‐dimensional domain I: Shortest paths.Arthur W. Chou & Ker-I. Ko - 2004 - Mathematical Logic Quarterly 50 (6):551-572.
Space-Time Intervals Underlie Human Conscious Experience, Gravity, and Everything.Richard Sieb - 2019 - Neuroquantology 17 (5):87-89.
Analytics
Added to PP
2020-12-22
Downloads
9 (#1,279,545)
6 months
7 (#491,772)
2020-12-22
Downloads
9 (#1,279,545)
6 months
7 (#491,772)
Historical graph of downloads
Citations of this work
A new approach to cyclic ordering of 2D orientations using ternary relation algebras.Amar Isli & Anthony G. Cohn - 2000 - Artificial Intelligence 122 (1-2):137-187.
Point algebras for temporal reasoning: Algorithms and complexity.Mathias Broxvall & Peter Jonsson - 2003 - Artificial Intelligence 149 (2):179-220.
Complexity classification in qualitative temporal constraint reasoning.Peter Jonsson & Andrei Krokhin - 2004 - Artificial Intelligence 160 (1-2):35-51.
The complexity of constraint satisfaction problems for small relation algebras.M. Cristani & R. Hirsch - 2004 - Artificial Intelligence 156 (2):177-196.
From binary temporal relations to non-binary ones and back☆☆Parts of this paper have been published in [36] and in [39]. [REVIEW]Steffen Staab - 2001 - Artificial Intelligence 128 (1-2):1-29.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-8fb5884b9-f9vjj uwo