Mark E. Stickel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 56 from 56

2009

Building Theorem ProversMark E. Stickel. cade 2009: 306-321 [doi]

2004

Deductive Question Answering from Multiple ResourcesRichard 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. ndqa 2004: 253-262

2001

Balance and Filtering in Structured Satisfiable Problems (Preliminary Report)Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel. endm, 9:2-18, 2001. [doi]

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

2000

Using Prior Knowledge: Problems and SolutionsVinay K. Chaudhri, Mark E. Stickel, Jérôme Thoméré, Richard J. Waldinger. AAAI 2000: 436-442

Implementing the Davis-Putnam MethodHantao Zhang, Mark E. Stickel. JAR, 24(1/2):277-296, 2000.

1997

A Practical Integration of First-Order Reasoning and Decision ProceduresNikolaj Bjørner, Mark E. Stickel, Tomás E. Uribe. cade 1997: 101-115

1996

SRI's Tipster II ProjectJerry R. Hobbs, Douglas E. Appelt, John Bear, David J. Israel, Megumi Kameyama, Andrew Kehler, Mark E. Stickel, Mabry Tyson. tipster 1996: 201-208 [doi]

1995

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

Studying Quasigroup Identities by Rewriting Techniques: Problems and First ResultsMark E. Stickel, Hantao Zhang. RTA 1995: 450-456

1994

Upside-Down Meta-Interpretation of the Model Elimination Theorem-Proving Procedure for Deduction and AbductionMark E. Stickel. JAR, 13(2):189-210, 1994.

Elimination of inference channels by optimal upgradingMark E. Stickel. sp 1994: 168-174 [doi]

Deductive Composition of Astronomical Software from Subroutine LibrariesMark E. Stickel, Richard J. Waldinger, Michael R. Lowry, Thomas Pressburger, Ian Underwood. cade 1994: 341-355

Ordered Binary Decision Diagrams and the Davis-Putnam ProcedureTomás E. Uribe, Mark E. Stickel. iccl 1994: 34-49

1993

Interpretation as AbductionJerry R. Hobbs, Mark E. Stickel, Douglas E. Appelt, Paul A. Martin. ai, 63(1-2):69-142, 1993.

Detection and elimination of inference channels in multilevel relational database systemsXiaolei Qian, Mark E. Stickel, Peter D. Karp, Teresa F. Lunt, Thomas D. Garvey. sp 1993: 196-205 [doi]

Automated theorem-proving research in the Fifth Generation Computer Systems Project: Model generation theorem proversMark E. Stickel. fgcs, 9(2):143-152, 1993. [doi]

1992

Caching and Lemmaizing in Model Elimination Theorem ProversOwen L. Astrachan, Mark E. Stickel. cade 1992: 224-238

Toward a Tool to Detect and Eliminate Inference Problems in the Design of Multilevel DatabasesThomas D. Garvey, Teresa F. Lunt, Xiaolei Qian, Mark E. Stickel. dbsec 1993: 149-168

A Prolog Technology Theorem Prover: A New Exposition and Implementation in PrologMark E. Stickel. TCS, 104(1):109-128, 1992.

Proving Properties of Rule-Based SystemsRichard J. Waldinger, Mark E. Stickel. ijseke, 2(1):121-144, 1992. [doi]

1991

Abductive and Approximate Reasoning Models for Characterizing Inference ChannelsThomas D. Garvey, Teresa F. Lunt, Mark E. Stickel. csfw 1991: 118-126

Monotonicity Properties in Automated DeductionZohar Manna, Mark E. Stickel, Richard Waldinger. BIRTHDAY 1991: 261-280 [doi]

A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretationMark E. Stickel. AMAI, 4:89-105, 1991.

PTTP and Linked InferenceMark E. Stickel. BIRTHDAY 1991: 283-296

1990

A Prolog Technology Theorem Prover: A New Exposition and Implementation in PrologMark E. Stickel. disco 1990: 154-163

A Prolog Technology Theorem ProverMark E. Stickel. cade 1990: 673-674

1989

TACITUS: A Message Understanding SystemJerry R. Hobbs, Douglas E. Appelt, John Bear, Mark E. Stickel, Mabry Tyson. naacl 1989: [doi]

More Advanced and Powerful Proof ToolsMark E. Stickel. ifip 1989: 791-792

Rationale and Methods for Abductice Reasoning in Natural-Language InterpretationMark E. Stickel. ibm 1990: 233-252

1988

1987

A Comparison of the Variable-Abstraction and Constant-Abstraction Methods for Associative-Commutative UnificationMark E. Stickel. JAR, 3(3):285-289, 1987.

1986

Set Theory in First-Order Logic: Clauses for Gödel s AxiomsRobert S. Boyer, Ewing L. Lusk, William McCune, Ross A. Overbeek, Mark E. Stickel, Larry Wos. JAR, 2(3):287-327, 1986.

Schubert s Steamroller Problem: Formulation and SolutionsMark E. Stickel. JAR, 2(1):89-101, 1986.

A prolog Technology Theorem Prover: Implementation by an Extended Prolog CompilerMark E. Stickel. cade 1986: 573-587

The KLAUS Automated Deduction SystemMark E. Stickel. cade 1986: 703-704

1985

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

Automated Deduction by Theory ResolutionMark E. Stickel. IJCAI 1985: 1181-1186

Automated Deduction by Theory ResolutionMark E. Stickel. JAR, 1(4):333-355, 1985.

An Introduction to Automated DeductionMark E. Stickel. ac 1986: 75-132

1984

A Prolog Technology Theorem ProverMark E. Stickel. SLP 1984: 211-217

A Prolog Technology Theorem ProverMark E. Stickel. ngc, 2(4):371-383, 1984.

A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring CommutativityMark E. Stickel. cade 1984: 248-258

1983

Theory Resolution: Building in Nonequational TheoriesMark E. Stickel. AAAI 1983: 391-397

A note on leftmost innermost term reductionMark E. Stickel. cca, 17(3-4):19-20, 1983. [doi]

1982

A Nonclausal Connection-Graph Resolution Theorem-Proving ProgramMark E. Stickel. AAAI 1982: 229-233

1981

Complete Sets of Reductions for Some Equational TheoriesGerald E. Peterson, Mark E. Stickel. JACM, 28(2):233-264, 1981. [doi]

A Unification Algorithm for Associative-Commutative FunctionsMark E. Stickel. JACM, 28(3):423-434, 1981. [doi]

1978

Fuzzy four-valued logic for inconsistency and uncertaintyMark E. Stickel. ismvl 1978: 91-94 [doi]

1976

A Hole in Goal Trees: Some Guidance from Resolution TheoryDonald W. Loveland, Mark E. Stickel. TC, 25(4):335-341, 1976.

1975

A Complete Unification Algorithm for Associative-Commutative FunctionsMark E. Stickel. IJCAI 1975: 71-76

1973

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

Sign in or sign up to see more results.

runs on WebDSL