Constants and finite unary relations in qualitative constraint reasoning

DOI10.1016/J.ARTINT.2017.12.003zbMATH Open1445.68112OpenAlexW2780906569MaRDI QIDQ1749385FDOQ1749385

Authors: Peter Jonsson 

Publication date: 16 May 2018

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2017.12.003

Recommendations

• Finite unary relations and qualitative constraint satisfaction
• scientific article
• Qualitative constraint satisfaction problems: an extended framework with landmarks
• Complexity classification in qualitative temporal constraint reasoning
• The complexity of constraint satisfaction problems (invited talk)

zbMATH Keywords

computational complexityconstraint satisfactionqualitative reasoning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Maintaining knowledge about temporal intervals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-dichotomies in Constraint Satisfaction Complexity
• Weak Composition for Qualitative Spatial and Temporal Reasoning
• The complexity of temporal constraint satisfaction problems
• Reasoning about temporal relations
• Model Theory
• Cores of Countably Categorical Structures
• Classifying the Complexity of Constraints Using Finite Algebras
• A unifying approach to temporal constraint reasoning
• On the algebraic structure of combinatorial problems
• Core-like properties of infinite graphs and structures
• Building tractable disjunctive constraints
• Constraint Satisfaction Problems Solvable by Local Consistency Methods
• Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
• Title not available (Why is that?)
• Decidability of definability
• A tableau algorithm for description logics with concrete domains and general TBoxes
• Conservative constraint satisfaction re-revisited
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• Querying incomplete information in RDF with SPARQL
• Qualitative constraint satisfaction problems: an extended framework with landmarks
• On the complexity of integer programming
• A survey of homogeneous structures
• A relation-algebraic approach to the region connection calculus
• On topological consistency and realization
• The 116 reducts of (ℚ, <, a)
• Title not available (Why is that?)
• Equivalence constraint satisfaction problems
• Expressive power and complexity in algebraic logic
• Tractable set constraints
• Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
• Datalog and constraint satisfaction with infinite templates
• Relation algebras of intervals
• A fast algorithm and Datalog inexpressibility for temporal reasoning
• A model-theoretic view on qualitative constraint reasoning
• The reducts of the homogeneous binary branching \(C\)-relation
• SAT vs. search for qualitative temporal reasoning
• Finite unary relations and qualitative constraint satisfaction
• A complexity dichotomy for poset constraint satisfaction
• Title not available (Why is that?)
• Qualitative temporal and spatial reasoning revisited

Cited In (7)

• Computational Short Cuts in Infinite Domain Constraint Satisfaction
• Qualitative constraint satisfaction problems: an extended framework with landmarks
• A model-theoretic view on qualitative constraint reasoning
• Finite unary relations and qualitative constraint satisfaction
• Solving infinite-domain CSPs using the patchwork property
• Expressing quantification in relational calculus by participation constraints
• Title not available (Why is that?)

This page was built for publication: Constants and finite unary relations in qualitative constraint reasoning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749385)