Inference systems for logical algorithms

Authors:
Natarajan Shankar
Affiliations:
Computer Science Laboratory, SRI International, Menlo Park, CA
Venue:
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2005

Citing 22
Cited 4

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
A view of the origins and development of Prolog

Communications of the ACM
Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving

Journal of the ACM (JACM)
A Practical Decision Procedure for Arithmetic with Function Symbols

Journal of the ACM (JACM)
Variations on the Common Subexpression Problem

Journal of the ACM (JACM)
Deciding Combinations of Theories

Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
An algorithm for reasoning about equality

Communications of the ACM
A machine program for theorem-proving

Communications of the ACM
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
The TPTP Problem Library

Journal of Automated Reasoning
HOL Light: A Tutorial Introduction

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Shostak's Congruence Closure as Completion

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Handbook of automated reasoning

Handbook of automated reasoning
Complexity of finitely presented algebras

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Abstract Congruence Closure

Journal of Automated Reasoning
A theoretical basis for the reduction of polynomials to canonical forms

ACM SIGSAM Bulletin
Empirical explorations of the logic theory machine: a case study in heuristic

IRE-AIEE-ACM '57 (Western) Papers presented at the February 26-28, 1957, western joint computer conference: Techniques for reliability
Proof-producing congruence closure

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

Trust and Automation in Verification Tools

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Automated deduction for verification

ACM Computing Surveys (CSUR)
A tutorial on satisfiability modulo theories

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Rewriting, inference, and proof

WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Logical algorithms are defined in terms of individual computation steps that are based on logical inferences. We present a uniform framework for formalizing logical algorithms based on inference systems. We present inference systems for algorithms such as resolution, the Davis–Putnam–Logemann–Loveland procedure, equivalence and congruence closure, and satisfiability modulo theories. The paper is intended as an introduction to the use of inference systems for studying logical algorithms.