Logical Engineering with Instance-Based Methods

Authors:
Peter Baumgartner
Affiliations:
NICTA and, Australian National University, Canberra, Australia
Venue:
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Year:
2007

Citing 35
Cited 7

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
The TPTP Problem Library

Journal of Automated Reasoning
Decidability by Resolution for Propositional Modal Logics

Journal of Automated Reasoning
Ordered Semantic Hyper-Linking

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

Journal of Automated Reasoning
Proceedings of the 12th International Conference on Automated Deduction

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Hyper Tableaux

JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
A Deduction Method Complete for Refutation and Finite Satisfiability

JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
A DPLL-Based Calculus for Ground Satisfiability Modulo Theories

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
The Disconnection Method - A Confluent Integration of Unification in the Analytic Framework

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Hyper Tableau - The Next Generation

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Integration of Equality Reasoning into the Disconnection Calculus

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
DCTP 1.2 - System Abstract

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
SATCHMO: A Theorem Prover Implemented in Prolog

Proceedings of the 9th International Conference on Automated Deduction
Semantically Guided First-Order Theorem Proving using Hyper-Linking

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
A Confluent Connection Calculus

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Resolution decision procedures

Handbook of automated reasoning
New Directions in Instantiation-Based Theorem Proving

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A calculus combining resolution and enumeration for building finite models

Journal of Symbolic Computation - Special issue: First order theorem proving
Hyperresolution for guarded formulae

Journal of Symbolic Computation - Special issue: First order theorem proving
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Comparing Instance Generation Methods for Automated Reasoning

Journal of Automated Reasoning
The Disconnection Tableau Calculus

Journal of Automated Reasoning
The axiomatic translation principle for modal logic

ACM Transactions on Computational Logic (TOCL)
SEM: a system for enumerating models

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Ordered semantic hyper linking

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Using a theorem prover for reasoning on constraint problems

AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Theory instantiation

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Lemma learning in the model evolution calculus

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Blocking and other enhancements for bottom-up model generation methods

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Geometric resolution: a proof procedure based on finite model search

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
The model evolution calculus with equality

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Deciding Effectively Propositional Logic Using DPLL and Substitution Sets

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
SMELS: Satisfiability Modulo Equality with Lazy Superposition

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
(LIA) - Model Evolution with Linear Integer Arithmetic Constraints

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Labelled unit superposition calculi for instantiation-based reasoning

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
A Combined Superposition and Model Evolution Calculus

Journal of Automated Reasoning
iProver-Eq: an instantiation-based theorem prover with equality

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Model Evolution with equality - Revised and implemented

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The term "instance based methods" (IMs) refers to a certain family of methods for first-order logic theorem proving. IMs share the principle of carrying out proof search by maintaining a set of instances of input clauses and analyzing it for satisfiability until completion. IMs are conceptually essentially different to well established methods like resolution or free-variable analytic tableaux. (See [Pla94] for a comparison of various calculi and strategies, including an instance based method.) Also, IMs exhibit a search space and termination behaviour (in the satisfiable case) different from those methods, which makes them attractive from a practical point of view as a complementary method.