Reasoning with Global Assumptions in Arithmetic Modal Logics-Reference-Cited by-同舟云学术

Reasoning with Global Assumptions in Arithmetic Modal Logics

Published:2015 Issue: Volume: Page:367-380
ISSN:0302-9743
Container-title:Fundamentals of Computation Theory
language:
Short-container-title:

Author:

Kupke Clemens,Pattinson Dirk,Schröder Lutz

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-22177-9_28

Reference31 articles.

1. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)

2. Baader, F., Sattler, U.: Description logics with symbolic number restrictions. In: European Conference on Artificial Intelligence, ECAI 1996, pp. 283–287. Wiley (1996)

3. Lecture Notes in Computer Science;E Bárcenas,2013

4. Canny, J.: Some algebraic and geometric computations in PSPACE. In: Symposium on Theory of Computing, STOC 1988, pp. 460–467. ACM (1988)

5. D’Agostino, G., Visser, A.: Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Logic 41, 267–298 (2002)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi;Logical Methods in Computer Science;2024-07-23

2. Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics;ACM Transactions on Computational Logic;2022-01-14

3. On the Algebrization of the Multi-valued Logics CG´3 and G´3;Computación y Sistemas;2021-12-05

4. One-variable logic meets Presburger arithmetic;Theoretical Computer Science;2020-01

5. Optimal Satisfiability Checking for Arithmetic $$\mu $$ -Calculi;Lecture Notes in Computer Science;2019