On the computational complexity of querying bounds on differences constraints
type: Item
instance of: scholarly article
title: On the computational complexity of querying bounds on differences constraints
zbMATH Open document ID: 1013.68558
DOI: 10.1016/0004-3702(95)00008-3
author: Vittorio Brusoni
author: Luca Console
author: Paolo Terenziani
published in: Artificial Intelligence
publication date: 2003-02-04T00:00:00Z
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 1863775
MaRDI profile type: Publication
full work available at URL: 0004-3702(95)00008-3
OpenAlex ID: W1978078190
cites work: Constraint propagation with interval labels
cites work: Temporal constraint networks
cites work: The logic of constraint satisfaction
Recommended article: Optimization of bound disjunctive queries with constraints
Recommended article: On Bounded Queries and Approximation
Recommended article: On the Structure of Bounded Queries to Arbitrary NP Sets
Recommended article: Computer Science Logic
Recommended article: Bounded queries, approximations, and the Boolean hierarchy
Recommended article: Complexity of solving a system of difference constraints with variables restricted to a finite set
Recommended article: Bounding queries in the analytic polynomial-time hierarchy
Recommended article: The complexity of problems for quantified constraints
Recommended article: Nondeterministic bounded query reducibilities
Recommended article: Q4945218
description: scientific article; zbMATH DE number 1863775