dblp.uni-trier.dewww.uni-trier.de

Tanel Tammet

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2006
20 Tanel Tammet, Hele-Mai Haav, Vello Kadarpik, Marko Kääramees: Using a Rule Language for Capturing Semantics in Web-Based Systems. DB&IS 2006: 249-259
19EEStephan Schulz, Geoff Sutcliffe, Tanel Tammet: Preface. International Journal on Artificial Intelligence Tools 15(1): 1-2 (2006)
2004
18EETanel Tammet: Chain Resolution for the Semantic Web. IJCAR 2004: 307-320
2003
17EETanel Tammet: Extending Classical Theorem Proving for the Semantic Web. PSSS 2003
16EETanel Tammet, Vello Kadarpik: Combining an Inference Engine with Database: A Rule Server. RuleML 2003: 136-149
2001
15 Christian G. Fermüller, Alexander Leitsch, Ullrich Hustadt, Tanel Tammet: Resolution Decision Procedures. Handbook of Automated Reasoning 2001: 1791-1849
1998
14EETanel Tammet: Towards Efficient Subsumption. CADE 1998: 427-441
13 Tanel Tammet, Jan M. Smith: Optimized Encodings of Fragments of Type Theory in First-Order Logic. J. Log. Comput. 8(6): 713-744 (1998)
1997
12 Tanel Tammet: Resolution, Inverse Method and the Sequent Calculus. Kurt Gödel Colloquium 1997: 65-83
11 Tanel Tammet: Gandalf. J. Autom. Reasoning 18(2): 199-204 (1997)
1996
10 Tanel Tammet: A Resolution Theorem Prover for Intuitonistic Logic. CADE 1996: 2-16
1995
9EETanel Tammet: Using Resolution for Extending KL-ONE-type Languages. CIKM 1995: 326-332
8EETanel Tammet, Jan M. Smith: Optimized Encodings of Fragments of Type Theory in First Order Logic. TYPES 1995: 265-287
7 Tanel Tammet: Completeness of Resolution for Definite Answers. J. Log. Comput. 5(4): 449-471 (1995)
1994
6 Tanel Tammet: Completeness of Resolution for Definite Answers with Case Analysis. CSL 1994: 309-323
5 Tanel Tammet: Proof Sytrategies in Linear Logic. J. Autom. Reasoning 12(3): 273-304 (1994)
1993
4 Christian G. Fermüller, Alexander Leitsch, Tanel Tammet, N. K. Zamov: Resolution Methods for the Decision Problem Springer 1993
1991
3 Tanel Tammet: Using Resolution for Deciding Solvable Classes and Building Finite Models. Baltic Computer Science 1991: 33-64
2 Grigori Mints, Tanel Tammet: Condensed Detachment is Complete for Relevance Logic: A Computer-Aided Proof. J. Autom. Reasoning 7(4): 587-596 (1991)
1988
1 Tanel Tammet: The resolution program, able to decide some solvable classes. Conference on Computer Logic 1988: 300-312

Coauthor Index

1Christian G. Fermüller [4] [15]
2Hele-Mai Haav [20]
3Ullrich Hustadt [15]
4Marko Kääramees [20]
5Vello Kadarpik [16] [20]
6Alexander Leitsch [4] [15]
7Grigori Mints [2]
8Stephan Schulz [19]
9Jan M. Smith [8] [13]
10Geoff Sutcliffe [19]
11N. K. Zamov [4]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)