Combining instance generation and resolution

Authors:
Christopher Lynch;Ralph Eric McGregor
Affiliations:
Clarkson University;Clarkson University
Venue:
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Year:
2009

Citing 15
Cited 2

Computation-oriented reductions of predicate to propositional logic

Decision Support Systems
The resolution calculus

The resolution calculus
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)
Automatic Theorem Proving With Renamable and Semantic Resolution

Journal of the ACM (JACM)
Automating first-order relational logic

SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
A machine program for theorem-proving

Communications of the ACM
The TPTP Problem Library

Journal of Automated Reasoning
Partial Instantiation Methods for Inference in First-Order Logic

Journal of Automated Reasoning
Deciding Separation Formulas with SAT

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
New Directions in Instantiation-Based Theorem Proving

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)
The model evolution calculus as a first-order DPLL method

Artificial Intelligence
The CADE-21 automated theorem proving system competition

AI Communications
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems

A Combined Superposition and Model Evolution Calculus

Journal of Automated Reasoning
SMELS: Satisfiability Modulo Equality with Lazy Superposition

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new inference system for first-order logic, SIGRes, which couples together SInst-Gen and ordered resolution into a single inference system. Given a set F of first order clauses we create two sets, P and R, each a subset of F. Under SIG-Res, P is saturated by SInst-Gen and resolution is applied to pairs of clauses in P ∪ R where at least one of the clauses is in R. We discuss the motivation for this inference system and prove its completeness. We also discuss our implementation called Spectrum and give some initial results.