Axiomatizing the Cyclic Interval Calculus

نویسندگان

  • Jean-François Condotta
  • Gérard Ligozat
چکیده

A model for qualitative reasoning about intervals on a cyclic time has been recently proposed by Balbiani and Osmani (Balbiani & Osmani 2000). In this formalism, the basic entities are intervals on a circle, and using considerations similar to Allen’s calculus, sixteen basic relations are obtained, which form a jointly disjunctive and pairwise distinct (JEPD) set of relations. The purpose of this paper is to give an axiomatic description of the calculus, based on the properties of the meets relation, from which all other fifteen relations can be deduced. We show how the corresponding theory is related to cyclic orderings, and use the results to prove that any countable model of this theory is isomorphic to the cyclic interval structure based on the rational numbers. Our approach is similar to Ladkin’s axiomatization of Allen’s calculus, although the cyclic structures introduce specific difficulties.

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

ثبت نام

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

منابع مشابه

Axiomatizing a Real-Valued Modal Logic

A many-valued modal logic is introduced that combines the standard (crisp) Kripke frame semantics of the modal logic K with connectives interpreted locally as abelian group operations over the real numbers. A labelled tableau system and a sequent calculus admitting cut elimination are then defined for this logic and used to establish completeness of an axiomatic extension of the multiplicative ...

متن کامل

Scheduling in the Situation Calculus : A Case

We illustrate the utility of the situation calculus for representing complex scheduling tasks by axiomatizing a deadline driven scheduler in the language. The actions arising in such a scheduler are examples of natural actions, as investigated in the concurrent situation calculus by Pinto 10], and later by Reiter 13]. Because the deadline driven scheduler is sequential, we must rst suitably mod...

متن کامل

Continuous Processes in the Fluent Calculus

Among the known predicate calculus formalisms for axiomatizing commonsense reasoning about actions, the Fluent Calculus stands out in offering a solution not only to the representational but also the inferential aspect of the fundamental Frame Problem. In this paper we extend this formalism to modeling hybrid systems, which involve both discrete and continuous change. We borrow basic notions fr...

متن کامل

Axiomatizing Epistemic Logic of Friendship via Tree Sequent Calculus

This paper positively solves an open problem if it is possible to provide a Hilbert system to Epistemic Logic of Friendship (EFL) by Seligman, Girard and Liu. To find a Hilbert system, we first introduce a sound, complete and cut-free tree (or nested) sequent calculus for EFL, which is an integrated combination of Seligman’s sequent calculus for basic hybrid logic and a tree sequent calculus fo...

متن کامل

Axiomatizing St Bisimulation for a Process Algebra with Recursion and Action Reenement (extended Abstract)

Due to the complex nature of bisimulation equivalences which express some form of history dependence, it turned out to be problematic to axiomatize them for non trivial classes of systems. Here we introduce the idea of \compositional level-wise renaming" which gives rise to the new possibility of axiomatizing the class of history dependent bisimulations with slight modiications to the machinery...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2004