α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic-Reference-Cited by-同舟云学术

α lean TA P: A Declarative Theorem Prover for First-Order Classical Logic

Published:2008 Issue: Volume: Page:238-252
ISSN:0302-9743
Container-title:Logic Programming
language:
Short-container-title:

Author:

Near Joseph P.,Byrd William E.,Friedman Daniel P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-89982-2_26

Reference25 articles.

1. Beckert, B., Posegga, J.: leanTAP: Lean tableau-based deduction. Journal of Automated Reasoning 15(3), 339–358 (1995)

2. Byrd, W.E., Friedman, D.P.: αKanren: A fresh name in nominal logic programming. In: Proceedings of the 2007 Workshop on Scheme and Functional Programming, Université Laval Technical Report DIUL-RT-0701, pp. 79–90 (2007), http://www.cs.indiana.edu/~webyrd

3. Mellish, C.S.: The Automatic Generation of Mode Declarations for Prolog Programs. Dept. of Artificial Intelligence, University of Edinburgh (1981)

4. Lecture Notes in Computer Science;A.M. Pitts,2001

5. Urban, C., Pitts, A., Gabbay, M.: Nominal unification. Theoretical Computer Science 323(1-3), 473–497 (2004)

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

1. Nominal syntax with atom substitutions;Journal of Computer and System Sciences;2021-08

2. Efficient fair conjunction for structurally-recursive relations;Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation;2021-01-17

3. Nominal Equational Problems;Lecture Notes in Computer Science;2021

4. Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting;Fundamentals of Computation Theory;2019

5. A Framework for Extending microKanren with Constraints;Electronic Proceedings in Theoretical Computer Science;2017-01-01