A Tableau Calculus for Minimal Modal Model Generation

نویسندگان

  • Fabio Papacchini
  • Renate A. Schmidt
چکیده

Model generation and minimal model generation is useful for fault analysis, verification of systems and validation of data models. Whereas for classical propositional and first-order logic several model minimization approaches have been developed and studied, for non-classical logic the topic has been much less studied. In this paper we introduce a minimal model generation calculus for multi-modal logic K(m) and extensions of K(m) with the axioms T and B. The calculus provides a method to generate all and only minimal modal Herbrand models, and each model is generated exactly once. A novelty of the calculus is a non-standard complement splitting rule designed for minimal model generation. Experiments show the rule has the added benefit of reducing the search space.

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

ثبت نام

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

منابع مشابه

Computing Minimal Models Modulo Subset-Simulation for Modal Logics

In this paper we propose a novel minimality criterion for models of modal logics based on a variation of the notion of simulation, called subset-simulation. We present a minimal model sound and complete tableau calculus for the generation of this new kind of minimal models for the multi-modal logic K(m), and we discuss extensions to cover more expressive logics. The generation of minimal models...

متن کامل

Terminating tableau calculi for modal logic K with global counting operators

This paper presents the first systematic treatment of tableau calculi for modal logic K with global counting operators. Using a recently introduced tableau synthesis framework we establish two terminating tableau calculi for the logic. Whereas the first calculus is a prefix tableau calculus, the second is a refinement that internalises the semantics of the logic without using nominals. We prove...

متن کامل

Minimal Models Modulo Subset-Simulation for Modal Logics

In this abstract we present a novel minimality criterion for models of propositional modal logics, and we sketch a tableau calculus for the generation of minimal models based on this new minimality criterion.

متن کامل

Constraint Tableaux for Hybrid Logics Draft

Hybrid logics are modal logics with names for worlds. Tableau systems for various hybrid logics were proposed in [6, 7, 20]. We present an improved tableau system for hybrid logic that handles equality for nominals by substitution and generation of inequality constraints. This compiles out the equalities while storing the inequalities, thus allowing for efficient equality reasoning. The proof p...

متن کامل

Modal #-Calculus, Model Checking and Gaufl Elimination

In this paper we present a novel approach for solving Boolean equation systems with nested minimal and maximal fixpoints. The method works by successively eliminating variables and reducing a Boolean equation system similar to Gaufl elimination for linear equation systems. It does not require backtracking techniques. Within one framework we suggest a global and a local algorithm. In the context...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 278  شماره 

صفحات  -

تاریخ انتشار 2011