M. Baldoni. Normal multimodal logics with interaction axioms. In D. Basin, M. D'Agostino, D. M. Gabbay, and L. Vigano, editors, Labelled Deduction, pages 33--57. Kluwer, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....using disjunction and composition. Let # be a set modal formulae in the language of multi modal K (m) and let K (m) # be the extension of K (m) closed under the formulae in #. For example, the axiom schema listed in Figure 4 determine classes of logics considered in Catach [9] and Baldoni [5]. Theorem 6.8 Let # be any finite set of instances of formulae in Figure 4, and let # be the set of associated first order properties as specified in Figure 4. Then: For any modal formula #, # is satisfiable in K (m) # i# # #(#) is first order satisfiable. Proof. By noting that disjunction ....

M. Baldoni. Normal multimodal logics with interaction axioms. In D. Basin, M. D'Agostino, D. M. Gabbay, and L. Vigano, editors, Labelled Deduction, pages 33--57. Kluwer, 2000.

.... logics can very often be combined in a simple and natural way provided we have a suitable LDS formulation for them (see, e.g. 21, 22, 4] In LDSs the usual modal semantics is incorporated in the syntactic label construction and only minor variations are needed to pass from one logic to another [1, 4, 21, 22, 25, 5, 36, 40]. Thus, once an automated LDS is available for some appropriate modal systems, only slight natural changes in the modal LDS are needed to yield the appropriate semantics for CLs and nonmonotonic consequence relations. More precisely, we use a labelled tableau system, called KEM, suitable for a ....

Matteo Baldoni. Normal multimodal logic with interaction axioms. In D. Basin, pages 33--58. Kluwer, Dordrecht, 2000.

....n) are either procedure names, or atomic or test actions, the above axiom can be interpreted as a procedure definition, which can then be executed in a goal directed way, similarly to standard logic programs. These axioms have the form of inclusion axioms, which were the subject of a previous work [5, 2], in which we have analyzed the class of multimodal logics characterized by axioms of the form [s 1 ] s m ] p 1 ] p n ] where [s i ] and [p i ] are modal operators. These axioms have interesting computational properties because they can be considered as rewriting rules. We show ....

....or not. 2.2 Sensing Actions: Gathering Information from the World Let us now consider sensing actions, which allow an agent to gather information from the environment, enhancing its knowledge about the value of a uent. In our representation sensing actions are de ned by modal inclusion axioms [2], in terms of ad hoc primitive actions. We represent a binary sensing action s 2 S, for knowing whether the uent l or its complement :l is true, by means of axioms of our logic that specify the e ects of s on agent knowledge as the nondeterministic choice between two primitive actions, the one ....

[Article contains additional citation context not shown here]

M. Baldoni. Normal Multimodal Logics with Interaction Axioms. In D. Basin, M. D'Agostino, D. M. Gabbay, S. Matthews, and L. Vigano, editors, Labelled Deduction, volume 17 of Applied Logic Series, pages 33-53. Applied Logic Series, Kluwer Academic Publisher, 2000.

No context found.

M. Baldoni. Normal multimodal logics with interaction axioms. In D. Basin, M. D'Agostino, D. M. Gabbay, and L. Vigano, editors, Labelled Deduction, pages 33--57. Kluwer, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC