排序方式: 共有13条查询结果,搜索用时 203 毫秒
1.
2.
The LA-logics (“logics with Local Agreement”) are polymodal logics defined semantically such that at any world of a model, the sets of successors for the different accessibility relations can be linearly ordered and the accessibility relations are equivalence relations. In a previous work, we have shown that every LA-logic defined with a finite set of modal indices has an NP-complete satisfiability problem. In this paper, we introduce a class of LA-logics with a countably infinite set of modal indices and we show that the satisfiability problem is PSPACE-complete for every logic of such a class. The upper bound is shown by exhibiting a tree structure of the models. This allows us to establish a surprising correspondence between the modal depth of formulae and the number of occurrences of distinct modal connectives. More importantly, as a consequence, we can show the PSPACE-completeness of Gargov's logic DALLA and Nakamura's logic LGM restricted to modal indices that are rational numbers, for which the computational complexity characterization has been open until now. These logics are known to belong to the class of information logics and fuzzy modal logics, respectively. 相似文献
3.
4.
We define cut-free display calculi for knowledge logics wherean indiscernibility relation is associated to each set of agents, andwhere agents decide the membership of objects using thisindiscernibility relation. To do so, we first translate the knowledgelogics into polymodal logics axiomatised by primitive axioms and thenuse Kracht's results on properly displayable logics to define thedisplay calculi. Apart from these technical results, we argue thatDisplay Logic is a natural framework to define cut-free calculi for manyother logics with relative accessibility relations. 相似文献
5.
Stéphane Demri 《Journal of Logic, Language and Information》1999,8(2):167-185
We study a knowledge logic that assumes that to each set of agents, an indiscernibility relation is associated and the agents decide the membership of objects or states up to this indiscernibility relation. Its language contains a family of relative knowledge operators. We prove the decidability of the satisfiability problem, we show its EXPTIME-completeness and as a side-effect, we define a complete Hilbert-style axiomatization. 相似文献
6.
A Reduction from DLP to PDL 总被引:2,自引:0,他引:2
7.
A Modal Perspective on Path Constraints 总被引:2,自引:0,他引:2
Alechina Natasha; Demri Stephane; de Rijke Maarten 《Journal of Logic and Computation》2003,13(6):939-956
8.
Stéphane Demri Ewa Orlowska Ingrid Rewitzky 《Annals of Mathematics and Artificial Intelligence》1994,12(3-4):265-289
A logical framework is presented for defining semantics of programs that satisfy Hoare postulates. The two families of logical systems are given: modal systems and relational systems. In the modal systems semantics of Hoare-style programming languages is provided in terms of relations and sets, and in relational systems in terms of relations only. Proof theory for the given logics is presented. 相似文献
9.
The addition of promoters to rhodium catalysts has been studied for CO hydrogenation. Differences in temperature programmed desorption and reaction show that the support and promoter have an influence on the dissociation of carbon monoxide. A low temperature methane peak appears at 110°C in the CO temperature programmed hydrogenation on the unpromoted catalyst. The mechanistic implications of these results are discussed. 相似文献
10.
S. Boujana D. Demri J. Cressely A. Kiennemann J. P. Hindermann 《Catalysis Letters》1990,7(5-6):359-366
New CO absorption bands were observed on promoted Pd and Pt catalysts and were attributed to C and O coordination of CO. The possibility of selective coverage of some metal faces by the promoter is discussed. TPD and FT-IR experiments show that the promoters stabilize an acetyl species upon adsorption of acetaldehyde. 相似文献