Querying temporal and spatial constraint networks in PTIME
From MaRDI portal
(Redirected from Publication:1589478)
Recommendations
- The complexity of query evaluation in indefinite temporal constraint databases
- Temporal constraint networks
- Querying temporal constraint networks: A unifying approach
- Variable independence for first-order definable constraints
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
Cites work
- A canonical form for generalized linear constraints
- A Sufficient Condition for Backtrack-Free Search
- A unifying approach to temporal constraint reasoning
- Deciding Linear Inequalities by Computing Loop Residues
- Efficient algorithms for qualitative reasoning about time
- Foundations of a functional approach to knowledge representation
- From local to global consistency
- From local to global consistency in temporal constraint networks
- scientific article; zbMATH DE number 3862494 (Why is no real title available?)
- scientific article; zbMATH DE number 4166937 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 907667 (Why is no real title available?)
- scientific article; zbMATH DE number 4197471 (Why is no real title available?)
- Incomplete Information in Relational Databases
- Maintaining knowledge about temporal intervals
- Network-based heuristics for constraint-satisfaction problems
- On point-based temporal disjointness
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- On the computational complexity of querying bounds on differences constraints
- On the representation and querying of sets of possible worlds
- Qualitative representation of spatial knowledge
- Reasoning about partially ordered events
- Reasoning about qualitative temporal information
- Reasoning about temporal relations
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- Temporal constraint networks
- The complexity of query evaluation in indefinite temporal constraint databases
- The complexity of querying indefinite data about linearly ordered domains
- The problem of incomplete information in relational databases
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
Cited in
(11)- The complexity of query evaluation in indefinite temporal constraint databases
- Solving multi-granularity temporal constraint networks
- Time-bounded query generator for constraint acquisition
- Probabilistic spatio-temporal knowledge bases: capacity constraints, count queries, and consistency checking
- Querying temporal constraint networks: A unifying approach
- PTIME parametric verification of safety properties for reasonable linear hybrid automata
- Count queries in probabilistic spatio-temporal knowledge bases with capacity constraints
- On the consistency of cardinal direction constraints
- scientific article; zbMATH DE number 1670829 (Why is no real title available?)
- Variable independence for first-order definable constraints
- A Logic of East and West
This page was built for publication: Querying temporal and spatial constraint networks in PTIME
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589478)
