Incremental recomputation in local languages.
type: Item
instance of: scholarly article
title: Incremental recomputation in local languages.
zbMATH Open document ID: 1054.68085
DOI: 10.1016/S0890-5401(03)00017-8
author: Guozhu Dong
author: Limsoon Wong
author: Leonid Libkin
published in: Information and Computation
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1967121
zbMATH Keywords: Incremental recomputation
zbMATH Keywords: First-order logic
zbMATH Keywords: Transitive closure
zbMATH Keywords: Locality
zbMATH Keywords: SQL
Wikidata QID: Q61910881
MaRDI profile type: Publication
cites work: Q4864249
cites work: Principles of programming with complex objects and collection types
cites work: Incremental and decremental evaluation of transitive closure by first- order queries
cites work: Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
cites work: Deterministic FOIES are strictly weaker
cites work: Q4850061
cites work: On monadic NP vs monadic co-NP
cites work: Q3666827
cites work: Locality of order-invariant first-order formulas
cites work: Notions of locality and their logical characterizations over finite models
cites work: Logics with aggregate operators
cites work: Q4252752
cites work: Q4473274
cites work: Languages that Capture Complexity Classes
cites work: Q4227581
cites work: Query languages for bags and aggregate functions
cites work: Q4473152
cites work: Complexity models for incremental computation
cites work: Dyn-FO: A parallel, dynamic complexity class
full work available at URL: s0890-5401(03)00017-8
OpenAlex ID: W2045841926
description: scientific article; zbMATH DE number 1967121