scientific article; zbMATH DE number 2044758

zbMATH Open1042.68797MaRDI QIDQ4448731FDOQ4448731

Authors: Alexander Scivos, Bernhard Nebel 

Publication date: 18 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2205/22050431.htm

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1841828
• On the quantifier-free dynamic complexity of reachability
• On the Quantifier-Free Dynamic Complexity of Reachability
• A trajectory calculus for qualitative spatial reasoning using answer set programming
• Undecidability results for multi-lane spatial logic
• The computational complexity of propositional cirquent calculus
• Complexity of Decision Problems for Mixed and Modal Specifications
• A roadmap to decidability
• scientific article; zbMATH DE number 5295708
• Decidability of a hybrid duration calculus

zbMATH Keywords

constraint propagationqualitative spatial reasoningspatial and temporal reasoningincomplete or imprecise spatial knowledgelanguages of spatial relationsternary relation systems

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Cited In (2)

• Qualitative reasoning with directional relations
• On the realisability of double-cross matrices by polylines in the plane

This page was built for publication:

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