Article

# Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions

(Impact Factor: 0.72). 01/2009; 92(4):307-343. DOI: 10.3233/Fi-2009-77
Source: DBLP

ABSTRACT

In earlier papers we have introduced an algorithm, SQEMA, for computing first-order equivalents and proving canonicity of modal formulae. However, SQEMA is not complete with respect to the so called complex Sahlqvist formulae. In this paper we, first, introduce the class of complex inductive formulae, which extends both the class of complex Sahlqvist formulae and the class of polyadic inductive formulae, and second, extend SQEMA to SQEMAsub by allowing suitable substitutions in the process of transformation. We prove the correctness of SQEMAsub with respect to local equivalence of the input and output formulae and d-persistence of formulae on which the algorithm succeeds, and show that SQEMAsub is complete with respect to the class of complex inductive formulae.

### Full-text

Available from: Dimiter Vakarelov
• ##### Conference Paper: Algorithmic Definability and Completeness in Modal Logic.
[Hide abstract]
ABSTRACT: One of the nice features of modal languages is that sometimes they can talk about abstract properties of the corresponding semantic structures. For instance the truth of the modal formula \square pÞ p\square p\Rightarrow p in the Kripke frame (W,R) is equivalent to the reflexivity of the relation R. Using a terminology from modal logic [13], we say that the condition of reflexivity – ( ∀ x)(xRx), is a first-order equivalent of the modal formula \square pÞ p\square p\Rightarrow p, or, that the formula \square pÞ p\square p\Rightarrow p is first-order definable by the condition ( ∀ x)(xRx). More over, adding the formula \square pÞ p\square p\Rightarrow p to the axioms of the minimal modal logic K we obtain a complete logic with respect to the class of reflexive frames and the completeness proof can be done by the well known in modal logic canonical method (such formulas are called canonical). Let us note that definability and completeness are some of the good features in the applications of modal logic, and hence it is important to have algorithmic methods for establishing such properties. In our talk we will describe several algorithmic approaches to this problem.
Foundations of Information and Knowledge Systems, 6th International Symposium, FoIKS 2010, Sofia, Bulgaria, February 15-19, 2010. Proceedings; 01/2010
• Source
##### Article: Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
[Hide abstract]
ABSTRACT: The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents of modal formulae in the extension of first-order logic with monadic least fixed-points FOμ. This computation operates by transforming input formulae into locally frame equivalent ones in the pure fragment of the hybrid μ-calculus. In particular, we prove that the recursive extension of SQEMA succeeds on the class of ‘recursive formulae’. We also show that a certain version of this algorithm guarantees the canonicity of the formulae on which it succeeds.
Journal of Applied Logic 12/2010; 8(4-8):319-333. DOI:10.1016/j.jal.2010.08.002 · 0.58 Impact Factor
• Source
##### Article: On the Soundness, Completeness and Applicability of the Logic of Knowledge and Communicative Commitments in Multi-Agent Systems
[Hide abstract]
ABSTRACT: Benthem’s correspondence theory is one of the most important tools of the theory of modal logics developed in the last three decades. Correspondence theory, a subfield of the model theory, reflects a systematic study of relations between classes of frames and modal language. In this paper, we use correspondence theory for modal logics to solve a problem not addressed yet in the literature, namely the soundness and completeness of a logic combining two different, yet related modalities: agents’ knowledge and commitments. The paper proves the soundness and completeness of this logic called CTLKC+. This work is highly significant as it proves that combining the two agents’ modalities resulted in a consistent logic that can be used to design reliable systems. The methodology is as follows: we develop a set of reasoning postulates (axioms) that reflect the interaction between agents’ knowledge and social commitments in Multi-Agent System (MAS) using the CTLKC+ logic and correspond them to certain classes of frames. In particular, we first give a name, formalization and meaning for each postulate. Then, we correspond the postulates to certain classes of frames and provide the required proofs. Thereafter, we present a discussion that illustrates the importance of the proposed postulates in MASs using a concrete application example called the NetBill protocol taken from the business domain. Finally, we show how the postulates were addressed in the literature. The existence of such a correspondence allows us to prove that the logic generated by any subset of these postulates is sound and complete with respect to models that are based on the corresponding frames. The ultimate goal of this paper is to further assess the logic of knowledge and commitments (CTLKC+) from a new perspective (i.e., the soundness and completeness). Consequently, this work advances the literature of logics in MASs and closes a gap that has not been explored before.
Expert Systems with Applications 08/2015; 43. DOI:10.1016/j.eswa.2015.08.019 · 2.24 Impact Factor