Reasoning about visibility

DOI10.1016/J.JAL.2012.02.001MaRDI QIDQ420853zbMATH OpenOpenAlexFDO

Authors Roger Villemaire, S. Hallé

Publication date 23 May 2012

Published in Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jal.2012.02.001

zbMATH Keywords

modal logicvisibilityspace

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 1182918
• Visibility queries in a polygonal region
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• Visibility between two edges of a simple polygon
• A modal logic for subject-oriented spatial reasoning

Cites work

• scientific article; zbMATH DE number 5295716 (Why is no real title available?)
• scientific article; zbMATH DE number 1470716 (Why is no real title available?)
• scientific article; zbMATH DE number 6876083 (Why is no real title available?)
• A calculus of individuals based on 'connection'
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• A special planar satisfiability problem and a consequence of its NP- completeness
• Box sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching
• Complexity and algorithms for reasoning about time
• Computational geometry. Algorithms and applications.
• Computing and Verifying Depth Orders
• Data and Applications Security XIX
• Decomposable searching problems
• Depth-First Search and Linear Graph Algorithms
• Handbook of Spatial Logics
• Individuals and points
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• Lower bounds for orthogonal range searching: I. The reporting case
• Maintaining knowledge about temporal intervals
• Many-dimensional modal logics: theory and applications
• Multidimensional binary search trees used for associative searching
• On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
• Optimal Point Location in a Monotone Subdivision
• Qualitative spatial representation and reasoning: An overview
• Structured firewall design
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The Complexity of the Partial Order Dimension Problem

Cited in

(3)

• Critical visibility and outward rays
• On the finite axiomatizability of the visibility relation over radars
• Surface reasoning

Describes a project that uses

Uses Software

• FIREMAN

This page was built for publication: Reasoning about visibility

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