|
Search the dblp DataBase
Lincoln A. Wallen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Donald Sannella, Lincoln A. Wallen
A Calculus for the Construction of Modular Prolog Programs. [Citation Graph (1, 0)][DBLP] J. Log. Program., 1992, v:12, n:1&2, pp:147-177 [Journal]
- David J. Pym, Lincoln A. Wallen
Logic Programming via Proof-valued Computations. [Citation Graph (0, 0)][DBLP] ALPUK, 1992, pp:253-262 [Conf]
- Michael R. Donat, Lincoln A. Wallen
Learning and Applying Generalised Solutions using Higher Order Resolution. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:41-60 [Conf]
- David J. Pym, Lincoln A. Wallen
Investigations into Proof-Search in a System of First-Order Dependent Function Types. [Citation Graph (0, 0)][DBLP] CADE, 1990, pp:236-250 [Conf]
- Eike Ritter, David J. Pym, Lincoln A. Wallen
Proof-Terms for Classical and Intuitionistic Resolution (Extended Abstract). [Citation Graph (0, 0)][DBLP] CADE, 1996, pp:17-31 [Conf]
- Jason Brown, Lincoln A. Wallen
Representing Unification in a Logical Framework. [Citation Graph (0, 0)][DBLP] CSL, 1995, pp:106-129 [Conf]
- Lincoln A. Wallen
Matrix Proof Methods for Modal Logics. [Citation Graph (0, 0)][DBLP] IJCAI, 1987, pp:917-923 [Conf]
- Lincoln A. Wallen
Automated Theorem Proving in Non-Classical Logics. [Citation Graph (0, 0)][DBLP] SCAI, 1988, pp:1-12 [Conf]
- Donald Sannella, Lincoln A. Wallen
A Calculus for the Construction of Modular Prolog Programs. [Citation Graph (0, 0)][DBLP] SLP, 1987, pp:368-378 [Conf]
- Eike Ritter, David J. Pym, Lincoln A. Wallen
On the Intuitionistic Force of Classical Search (Extended Abstract). [Citation Graph (0, 0)][DBLP] TABLEAUX, 1996, pp:295-311 [Conf]
- Eike Ritter, David J. Pym, Lincoln A. Wallen
Proof-terms for classical and intuitionistic resolution. [Citation Graph (0, 0)][DBLP] J. Log. Comput., 2000, v:10, n:2, pp:173-207 [Journal]
- Eike Ritter, David J. Pym, Lincoln A. Wallen
On the intuitionistic force of classical search. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:232, n:1-2, pp:299-333 [Journal]
Search in 0.003secs, Finished in 0.004secs
|