On the computational complexity of querying bounds on differences constraints

, &
Artificial Intelligence 74 (2):367-379 (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(95)00008-3

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

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

Through your library

My notes

Similar books and articles

A uniform method for proving lower bounds on the computational complexity of logical theories.Kevin J. Compton & C. Ward Henson - 1990 - Annals of Pure and Applied Logic 48 (1):1.
The Computational Complexity of Knot Genus and Spanning Area.Agol Ian, Hass Joel & P. Thurston William - unknown
A spectrum of definitions for temporal model-based diagnosis.Vittorio Brusoni, Luca Console, Paolo Terenziani & Daniele Theseider Dupré - 1998 - Artificial Intelligence 102 (1):39-79.
On the computational complexity of cut-reduction.Klaus Aehlig & Arnold Beckmann - 2010 - Annals of Pure and Applied Logic 161 (6):711-736.
Effective fractal dimensions.Jack H. Lutz - 2005 - Mathematical Logic Quarterly 51 (1):62-72.
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.
Some upper and lower bounds on decision procedures in logic.Jeanne Ferrante - 1974 - Cambridge: Project MAC, Massachusetts Institute of Technology.
Epistemological strata and the rules of right reason.Robert C. Cummins, Pierre Poirier & Martin Roth - 2004 - Synthese 141 (3):287 - 331.
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.
The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
Modeling complexity: cognitive constraints and computational model-building in integrative systems biology.Miles MacLeod & Nancy J. Nersessian - 2018 - History and Philosophy of the Life Sciences 40 (1):17.
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
Computational complexity of linear constraints over the integers.Peter Jonsson & Tomas Lööw - 2013 - Artificial Intelligence 195 (C):44-62.
Recursively Enumerable Equivalence Relations Modulo Finite Differences.André Nies - 1994 - Mathematical Logic Quarterly 40 (4):490-518.

Analytics

Added to PP
2020-12-22

Downloads
14 (#934,671)

6 months
14 (#154,299)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.
Temporal data base management.Thomas L. Dean & Drew V. McDermott - 1987 - Artificial Intelligence 32 (1):1-55.
Constraint propagation with interval labels.Ernest Davis - 1987 - Artificial Intelligence 32 (3):281-331.

Add more references