Probabilistic Region Connection Calculus

نویسندگان

  • Codruta Girlea
  • Eyal Amir
چکیده

We present a novel probabilistic model and specification language for spatial relations. Qualitative spatial logics such as RCC are used for representation and reasoning about physical entities. Our probabilistic RCC semantics enables a more expressive representation of spatial relations. We observe that reasoning in this new framework can be hard. We address this difficulty by using a factored representation based on Markov Random Fields. We formally present the syntax and semantics of a probabilistic RCC. We then use Markov Random Fields to represent our models compactly. Using this representation, we show a basic algorithm for answering queries about the probability of a relation to hold between two entities. Finally, we illustrate the effectiveness of the new approach experimentally over a small set of examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uncertain Spatiotemporal Logic for General Intelligence

Spatiotemporal reasoning is an important skill that an AGI is expected to have, innately or not. Much work has already been done in defining reasoning systems for space, time and spacetime, such as the Region Connection Calculus for space, Allen’s Interval Algebra for time, or the Qualitative Trajectory Calculus for motion. However, these reasoning systems rarely take adequate account of uncert...

متن کامل

Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics

We revisit a recently introduced probabilistic μ-calculus and study an expressive fragment of it. By using the probabilistic quantification as an atomic operation of the calculus we establish a connection between the calculus and obligation games. The calculus we consider is strong enough to encode well-known logics such as pctl and pctl∗. Its game semantics is very similar to the game semantic...

متن کامل

Tractable Probabilistic μ-Calculus That Expresses Probabilistic Temporal Logics∗

We revisit a recently introduced probabilistic μ-calculus and study an expressive fragment of it. By using the probabilistic quantification as an atomic operation of the calculus we establish a connection between the calculus and obligation games. The calculus we consider is strong enough to encode well-known logics such as pctl and pctl∗. Its game semantics is very similar to the game semantic...

متن کامل

A Necessary Relation Algebra for Mereotopology

We show that the basic operations of the relational calculus on a “contact relation” generate at least 25 relations in any model of the Region Connection Calculus [33], and we show how to interpret these relations in the collection of regular open sets in the two-dimensional Euclidean plane.

متن کامل

Cost Analysis of Games, Using Program Logic

Recent work in programming semantics has provided a relatively simple probablistic extension to predicate transformers, making it possible to treat small imperative probabilistic programs containing both demonic and angelic nondeterminism [11, 12, 20]. That work in turn was extended to provide a probabilistic basis for the modal μ-calculus [13], and leads to a quantitative μ-calculus [16, 18]. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012