Expressive Reasoning on Tree Structures: Recursion, Inverse Programs, Presburger Constraints and Nominals-Reference-Cited by-同舟云学术

Expressive Reasoning on Tree Structures: Recursion, Inverse Programs, Presburger Constraints and Nominals

Published:2013 Issue: Volume: Page:80-91
ISSN:0302-9743
Container-title:Advances in Artificial Intelligence and Its Applications
language:
Short-container-title:

Author:

Bárcenas Everardo,Lavalle Jesús

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-45114-0_7

Reference10 articles.

1. Bárcenas, E., Genevès, P., Layaïda, N., Schmitt, A.: Query reasoning on trees with types, interleaving, and counting. In: Walsh, T. (ed.) IJCAI, pp. 718–723. IJCAI/AAAI (2011)

2. Lecture Notes in Computer Science;P.A. Bonatti,2006

3. Bonatti, P.A., Peron, A.: On the undecidability of logics with converse, nominals, recursion and counting. Artif. Intell. 158(1), 75–96 (2004)

4. Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: Node selection query languages for trees. In: Fox, M., Poole, D. (eds.) AAAI. AAAI Press (2010)

5. Demri, S., Lugiez, D.: Complexity of modal logics with Presburger constraints. J. Applied Logic 8(3), 233–252 (2010)

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

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

2. A Satisfiability Algorithm For The Mu-Calculus For Trees With Presburger Constraints;2019 7th International Conference in Software Engineering Research and Innovation (CONISOFT);2019-10

3. Branching Path Planning with Modal Logics;Computación y Sistemas;2017-09-29

4. On Regular Paths with Counting and Data Tests;Electronic Notes in Theoretical Computer Science;2016-12

5. (Hyper)sequent Calculi for the ALC(S4) Description Logics;Computación y Sistemas;2016-03-31