Complete and Terminating Tableau for the Logic of Proper Subinterval Structures Over Dense Orderings
نویسندگان
چکیده
We introduce special pseudo-models for the interval logic of proper subintervals over dense linear orderings. We prove finite model property with respect to such pseudo-models, and using that result we develop a decision procedure based on a sound, complete, and terminating tableau for that logic. The case of proper subintervals is essentially more complicated than the case of strict subintervals, for which we developed a similar tableau-based decision procedure in a recent work.
منابع مشابه
Tableau Systems for Logics of Subinterval Structures over Dense Orderings
We construct a sound, complete, and terminating tableau system for the interval temporal logic D · interpreted in interval structures over dense linear orderings endowed with strict subinterval relation (where both endpoints of the sub-interval are strictly inside the interval). In order to prove the soundness and completeness of our tableau construction, we introduce a kind of finite pseudo-mo...
متن کاملOptimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders
In this paper, we focus our attention on tableau systems for the propositional interval logic of temporal neighborhood (Propositional Neighborhood Logic, PNL for short). PNL is the proper subset of Halpern and Shoham’s modal logic of intervals whose modalities correspond to Allen’s relations meets and met by. We first prove by a modeltheoretic argument that the satisfiability problem for PNL ov...
متن کاملA Tableau for RTL (long version)
We use mosaics to provide a simple, sound, complete and terminating tableau reasoning procedure for the temporal logic of until and since over the real numbers model of time.
متن کاملOptimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders
The study of interval temporal logics on linear orders is a meaningful research area in computer science and artificial intelligence. Unfortunately, even when restricted to propositional languages, most interval logics turn out to be undecidable. Decidability has been usually recovered by imposing severe syntactic and/or semantic restrictions. In the last years, tableau-based decision procedure...
متن کاملA Tableau System for Full Linear Temporal Logic
We present a sound, complete and terminating tableau system for the pro-positional logic of linear time with 2, 3, , W and U and the past operators To expand.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 231 شماره
صفحات -
تاریخ انتشار 2009