Computational complexity of linear constraints over the integers

&
Artificial Intelligence 195 (C):44-62 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2012.10.001

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,931

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

Linear-time temporal logics with Presburger constraints: an overview ★.Stéphane Demri - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):311-347.
Definability and decidability issues in extensions of the integers with the divisibility predicate.Patrick Cegielski, Yuri Matiyasevich & Denis Richard - 1996 - Journal of Symbolic Logic 61 (2):515-540.
The complexity of Horn fragments of Linear Logic.Max I. Kanovich - 1994 - Annals of Pure and Applied Logic 69 (2-3):195-241.
Kolmogorov complexity and set theoretical representations of integers.Marie Ferbus-Zanda & Serge Grigorieff - 2006 - Mathematical Logic Quarterly 52 (4):375-403.
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.
Rudimentary Languages and Second‐Order Logic.Malika More & Frédéric Olive - 1997 - Mathematical Logic Quarterly 43 (3):419-426.
A decision algorithm for linear sentences on a PFM.Lian Li, Huilin Li & Yixun Liu - 1993 - Annals of Pure and Applied Logic 59 (3):273-286.
Complexity and postmodernism: understanding complex systems.Paul Cilliers - 1998 - New York: Routledge.
Complexity of monodic guarded fragments over linear and real time.Ian Hodkinson - 2006 - Annals of Pure and Applied Logic 138 (1):94-125.
Computation models for parameterized complexity.Marco Cesati & Miriam Dilanni - 1997 - Mathematical Logic Quarterly 43 (2):179-202.
On a Question of Phillips.Çiǧdem Gencer & Mehmet Terziler - 1997 - Mathematical Logic Quarterly 43 (1):78-82.
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.
On the complexity of the pancake problem.Fuxiang Yu - 2007 - Mathematical Logic Quarterly 53 (4):532-546.
On the Import of Constraints in Complex Dynamical Systems.Cliff Hooker - 2013 - Foundations of Science 18 (4):757-780.

Analytics

Added to PP
2020-12-22

Downloads
19 (#823,744)

6 months
18 (#153,017)

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

Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.

Add more references