A Resolution-Based Theorem Prover for $${\textsf {K}}_{n}^{}$$Kn: Architecture, Refinements, Strategies and Experiments-Reference-Cited by-同舟云学术

A Resolution-Based Theorem Prover for $${\textsf {K}}_{n}^{}$$Kn: Architecture, Refinements, Strategies and Experiments

Published:2018-12-17 Issue:3 Volume:64 Page:461-484
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

Nalon Cláudia^ORCID,Hustadt Ullrich^ORCID,Dixon Clare^ORCID

Funder

Engineering and Physical Sciences Research Council

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10817-018-09503-x.pdf

Reference56 articles.

1. Areces, C., Gennari, R., Heguiabehere, J., de Rijke, M.: Tree-based heuristics in modal theorem proving. In: W. Horn (ed.) ECAI 2000, pp. 199–203. IOS Press, Amsterdam (2000)

2. Areces, C., Heguiabehere, J.: Hylores 1.0: Direct resolution for hybrid logics. In: A. Voronkov (ed.) CADE 2002, LNCS, vol. 2392, pp. 156–160. Springer, Berlin (2002)

3. Balbiani, P., Demri, S.: Prefixed tableaux systems for modal logics with enriched languages. In: M.E. Pollack (ed.) IJCAI 1997, pp. 190–195. Morgan Kaufmann, Los Altos (1997)

4. Balsiger, P., Heuerding, A., Schwendimann, S.: A benchmark method for the propositional modal logics K, KT, S4. J. Automat. Reason. 24(3), 297–317 (2000)

5. Basin, D., Matthews, S., Vigano, L.: Labelled propositional modal logics: theory and practice. J. Logic Comput. 7(6), 685–717 (1997)

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

1. Model Construction for Modal Clauses;Lecture Notes in Computer Science;2024

2. Resolution Calculi for Non-normal Modal Logics;Lecture Notes in Computer Science;2023

3. Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic;Automated Deduction – CADE 29;2023

4. Solving Modal Logic Problems by Translation to Higher-Order Logic;Lecture Notes in Computer Science;2023

5. Verifiable autonomy: From theory to applications;AI Communications;2022-09-20