Strategies in rigid-variable methods

Authors:
Andrei Voronkov
Affiliations:
Computing Science Department, Uppsala University, Uppsala, Sweden
Venue:
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Year:
1997

Citing 22
Cited 1

Theory of deductive systems and its applications

Theory of deductive systems and its applications
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Negation in logic programming

Foundations of deductive databases and logic programming
Rigid E-unification: NP-completeness and applications to equational matings

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Logic programming

Handbook of theoretical computer science (vol. B)
Theorem proving using equational matings and rigid E-unification

Journal of the ACM (JACM)
Methods and calculi for deduction

Handbook of logic in artificial intelligence and logic programming (vol. 1)
The undecidability of simultaneous rigid E-unification

Theoretical Computer Science
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Mechanical Theorem-Proving by Model Elimination

Journal of the ACM (JACM)
Theorem Proving via General Matings

Journal of the ACM (JACM)
On Matrices with Connections

Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming

Journal of the ACM (JACM)
Equality Elimination for the Tableau Method

DISCO '96 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Gentzen-type systems and resolution rules. Part I. Propositional logic

COLOG '88 Proceedings of the International Conference on Computer Logic
Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples (Extended Abstract)

CAAP '85 Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Volume 1: Colloquium on Trees in Algebra and Programming: Mathematical Foundations of Software Development
A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both Methods

CSL '88 Proceedings of the 2nd Workshop on Computer Science Logic
What You Always Wanted to Know About Rigid E-Unification

JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Simultaneous Rigid E-Unification and Related Algorithmic Problems

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Complexity of finitely presented algebras

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Semantics for disjunctive logic programs

Semantics for disjunctive logic programs
Equality elimination for the inverse method and extension procedures

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

A Confluent Connection Calculus

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study complexity of methods using rigid variables, like the method of matings or the tableau method, on a decidable class of predicate calculus with equality. We show some intrinsic complications introduced by rigid variables. We also consider strategies for increasing multiplicity in rigid-variable methods, and formally show that the use of intelligent strategies can result in an essential gain in efficiency.