Resolution theorem proving in reified modal logics-Reference-Cited by-同舟云学术

Resolution theorem proving in reified modal logics

Published:1994 Issue:1 Volume:12 Page:103-129
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

Aitken J. Stuart,Reichgelt Han,Shadbolt Nigel

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00881845.pdf

Reference23 articles.

1. Aitken, S., Reichgelt, H. and Shadbolt, N. (1992). Planning, knowledge division and agency,Proc. 11th UK Planning Special Interest Group.

2. Auffray, Y. and Enjalbert, P. (1989), Modal theorem proving: An equational viewpoint,Proc. IJCAI-11 441?445.

3. Auffray, Y., Enjalbert, P. and Hebrard, J. (1990), Strategies for modal resolution: results and problemsJ. Automated Reasoning 6 1?38.

4. Boyer, R. S. and Moore, J. S. (1972), The sharing of structure in theorem proving programs, in B. Meltzer and D. Michie (eds.),Machine Intelligence Vol 7, Edinburgh University Press, pp. 101?116

5. Catach, L. (1991), TABLEAUX: A general theorem prover for modal logics,J. Automated Reasoning 7 489?510.

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

1. Representing scope in intuitionistic deductions;Theoretical Computer Science;1999-01

2. Avoiding Omnidoxasticity in Logics of Belief: A Reply to MacPherson;Notre Dame Journal of Formal Logic;1995-07-01

3. Using connection method in modal logics: Some advantages;Theorem Proving with Analytic Tableaux and Related Methods;1995