Proof Search for the First-Order Connection Calculus in Maude

Authors:
Bjarne Holen;Einar Broch Johnsen;Arild Waaler
Affiliations:
Department of Informatics, University of Oslo, Norway;Department of Informatics, University of Oslo, Norway;Department of Informatics, University of Oslo, Norway
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 11
Cited 0

Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
The TPTP Problem Library

Journal of Automated Reasoning
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Reflection in conditional rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Connections in nonclassical logics

Handbook of automated reasoning
leanCoP: lean connection-based theorem proving

Journal of Symbolic Computation - Special issue: First order theorem proving
Deduction, Strategies, and Rewriting

Electronic Notes in Theoretical Computer Science (ENTCS)
Refutations by Matings

IEEE Transactions on Computers
Towards a Strategy Language for Maude

Electronic Notes in Theoretical Computer Science (ENTCS)
Clausal connection-based theorem proving in intuitionistic first-order logic

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
LoTREC: logical tableaux research engineering companion

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper develops a rewriting logic specification of the connection method for first-order logic, implemented in Maude. The connection method is a goal-directed proof procedure that requires a careful control over clause copies. The specification separates the inference rule layer from the rule application layer, and implements the latter at Maude's meta-level. This allows us to develop and compare different strategies for proof search.