Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

* | 2009 | |
---|---|---|

50 | EE | Mark E. Stickel: Building Theorem Provers. CADE 2009: 306-321 |

2004 | ||

49 | Richard J. Waldinger, Douglas E. Appelt, Jennifer L. Dungan, John Fry, Jerry R. Hobbs, David J. Israel, Peter Jarvis, David L. Martin, Susanne Riehemann, Mark E. Stickel, Mabry Tyson: Deductive Question Answering from Multiple Resources. New Directions in Question Answering 2004: 253-262 | |

2001 | ||

48 | Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel: Balance and Filtering in Structured Satisfiable Problems. IJCAI 2001: 351-358 | |

47 | EE | Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel: Balance and Filtering in Structured Satisfiable Problems (Preliminary Report). Electronic Notes in Discrete Mathematics 9: 2-18 (2001) |

2000 | ||

46 | Vinay K. Chaudhri, Mark E. Stickel, Jérôme Thoméré, Richard J. Waldinger: Using Prior Knowledge: Problems and Solutions. AAAI/IAAI 2000: 436-442 | |

45 | Hantao Zhang, Mark E. Stickel: Implementing the Davis-Putnam Method. J. Autom. Reasoning 24(1/2): 277-296 (2000) | |

1997 | ||

44 | EE | Nikolaj Bjørner, Mark E. Stickel, Tomás E. Uribe: A Practical Integration of First-Order Reasoning and Decision Procedures. CADE 1997: 101-115 |

43 | EE | Jerry R. Hobbs, Douglas E. Appelt, John Bear, David J. Israel, Megumi Kameyama, Mark E. Stickel, Mabry Tyson: FASTUS: A Cascaded Finite-State Transducer for Extracting Information from Natural-Language Text CoRR cmp-lg/9705013: (1997) |

1995 | ||

42 | EE | Mark E. Stickel: Term Rewriting in Contemporary Resolution Theorem Proving (Abstract). RTA 1995: 101 |

41 | EE | Mark E. Stickel, Hantao Zhang: Studying Quasigroup Identities by Rewriting Techniques: Problems and First Results. RTA 1995: 450-456 |

1994 | ||

40 | EE | Mark E. Stickel, Richard J. Waldinger, Michael R. Lowry, Thomas Pressburger, Ian Underwood: Deductive Composition of Astronomical Software from Subroutine Libraries. CADE 1994: 341-355 |

39 | Tomás E. Uribe, Mark E. Stickel: Ordered Binary Decision Diagrams and the Davis-Putnam Procedure. CCL 1994: 34-49 | |

38 | Mark E. Stickel: Upside-Down Meta-Interpretation of the Model Elimination Theorem-Proving Procedure for Deduction and Abduction. J. Autom. Reasoning 13(2): 189-210 (1994) | |

1993 | ||

37 | Jerry R. Hobbs, Mark E. Stickel, Douglas E. Appelt, Paul A. Martin: Interpretation as Abduction. Artif. Intell. 63(1-2): 69-142 (1993) | |

1992 | ||

36 | EE | Owen L. Astrachan, Mark E. Stickel: Caching and Lemmaizing in Model Elimination Theorem Provers. CADE 1992: 224-238 |

35 | Thomas D. Garvey, Teresa F. Lunt, Xiaolei Qian, Mark E. Stickel: Toward a Tool to Detect and Eliminate Inference Problems in the Design of Multilevel Databases. DBSec 1992: 149-168 | |

34 | EE | Richard J. Waldinger, Mark E. Stickel: Proving Properties of Rule-Based Systems. International Journal of Software Engineering and Knowledge Engineering 2(1): 121-144 (1992) |

33 | Mark E. Stickel: A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog. Theor. Comput. Sci. 104(1): 109-128 (1992) | |

1991 | ||

32 | Mark E. Stickel: PTTP and Linked Inference. Automated Reasoning: Essays in Honor of Woody Bledsoe 1991: 283-296 | |

31 | Thomas D. Garvey, Teresa F. Lunt, Mark E. Stickel: Abductive and Approximate Reasoning Models for Characterizing Inference Channels. CSFW 1991: 118-126 | |

30 | Mark E. Stickel: A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation. Ann. Math. Artif. Intell. 4: 89-105 (1991) | |

1990 | ||

29 | Mark E. Stickel: 10th International Conference on Automated Deduction, Kaiserslautern, FRG, July 24-27, 1990, Proceedings Springer 1990 | |

28 | EE | Mark E. Stickel: A Prolog Technology Theorem Prover. CADE 1990: 673-674 |

27 | EE | Mark E. Stickel: A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog. DISCO 1990: 154-163 |

1989 | ||

26 | Mark E. Stickel: More Advanced and Powerful Proof Tools. IFIP Congress 1989: 791-792 | |

25 | EE | Mark E. Stickel: Rationale and Methods for Abductice Reasoning in Natural-Language Interpretation. Natural Language and Logic 1989: 233-252 |

1988 | ||

24 | Jerry R. Hobbs, Mark E. Stickel, Paul A. Martin, Douglas Edwards: Interpretation as Abduction. ACL 1988: 95-103 | |

23 | EE | Mark E. Stickel: The KLAUS Automated Deduction System. CADE 1988: 750-751 |

22 | EE | Mark E. Stickel: A Prolog Technology Theorem Prover. CADE 1988: 752-753 |

21 | Mark E. Stickel: A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler. J. Autom. Reasoning 4(4): 353-380 (1988) | |

20 | Hans-Jürgen Bürckert, Alexander Herold, Deepak Kapur, Jörg H. Siekmann, Mark E. Stickel, Michael Tepp, Hantao Zhang: Opening the AC-Unification Race. J. Autom. Reasoning 4(4): 465-474 (1988) | |

1987 | ||

19 | Mark E. Stickel: A Comparison of the Variable-Abstraction and Constant-Abstraction Methods for Associative-Commutative Unification. J. Autom. Reasoning 3(3): 285-289 (1987) | |

1986 | ||

18 | EE | Mark E. Stickel: A prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler. CADE 1986: 573-587 |

17 | EE | Mark E. Stickel: The KLAUS Automated Deduction System. CADE 1986: 703-704 |

16 | Mark E. Stickel: Schubert's Steamroller Problem: Formulation and Solutions. J. Autom. Reasoning 2(1): 89-101 (1986) | |

15 | Robert S. Boyer, Ewing L. Lusk, William McCune, Ross A. Overbeek, Mark E. Stickel, Larry Wos: Set Theory in First-Order Logic: Clauses for Gödel's Axioms. J. Autom. Reasoning 2(3): 287-327 (1986) | |

1985 | ||

14 | Mark E. Stickel: An Introduction to Automated Deduction. Advanced Course: Fundamentals of Artificial Intelligence 1985: 75-132 | |

13 | Mark E. Stickel, Mabry Tyson: An Analysis of Consecutively Bounded Depth-First Search with Applications in Automated Deduction. IJCAI 1985: 1073-1075 | |

12 | Mark E. Stickel: Automated Deduction by Theory Resolution. IJCAI 1985: 1181-1186 | |

11 | Mark E. Stickel: Automated Deduction by Theory Resolution. J. Autom. Reasoning 1(4): 333-355 (1985) | |

1984 | ||

10 | EE | Mark E. Stickel: A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity. CADE 1984: 248-258 |

9 | Mark E. Stickel: A Prolog Technology Theorem Prover. SLP 1984: 211-217 | |

8 | Mark E. Stickel: A Prolog Technology Theorem Prover. New Generation Comput. 2(4): 371-383 (1984) | |

1983 | ||

7 | Mark E. Stickel: Theory Resolution: Building in Nonequational Theories. AAAI 1983: 391-397 | |

1982 | ||

6 | Mark E. Stickel: A Nonclausal Connection-Graph Resolution Theorem-Proving Program. AAAI 1982: 229-233 | |

1981 | ||

5 | EE | Gerald E. Peterson, Mark E. Stickel: Complete Sets of Reductions for Some Equational Theories. J. ACM 28(2): 233-264 (1981) |

4 | EE | Mark E. Stickel: A Unification Algorithm for Associative-Commutative Functions. J. ACM 28(3): 423-434 (1981) |

1976 | ||

3 | Donald W. Loveland, Mark E. Stickel: A Hole in Goal Trees: Some Guidance from Resolution Theory. IEEE Trans. Computers 25(4): 335-341 (1976) | |

1975 | ||

2 | Mark E. Stickel: A Complete Unification Algorithm for Associative-Commutative Functions. IJCAI 1975: 71-76 | |

1973 | ||

1 | Donald W. Loveland, Mark E. Stickel: A Hole in Goal Trees: Some Guidance from Resolution Theory. IJCAI 1973: 153-161 |