On Matrices with Connections

Cited in

(35)

Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem
Set of support, demodulation, paramodulation: a historical perspective
A typed resolution principle for deduction with conditional typing theory
Simultaneous rigid E-unification is undecidable
Linearity and regularity with negation normal form
On the termination of clause graph resolution
From Schütte’s Formal Systems to Modern Automated Deduction
A new reduction rule for the connection graph proof procedure
A new subsumption method in the connection graph proof procedure
ABox abduction in the description logic \(\mathcal{ALC}\)
On structures of regular standard contradictions in propositional logic
Progress in the Development of Automated Theorem Proving for Higher-Order Logic
A tableau method for the Lambek calculus based on a matrix characterization
A logical framework for depiction and image interpretation
A kind of logical compilation for knowledge bases
Proof-terms for classical and intuitionistic resolution
What you always wanted to know about rigid \(E\)-unification
On connections and higher-order logic
T-string unification: unifying prefixes in non-classical proof methods
The disconnection tableau calculus
Compressing propositional refutations
Combining formal derivation search procedures and natural theorem proving techniques in an automated theorem proving system
On structures of sign-boundary and diagonal vacancy-type standard contradictions
A uniform procedure for converting matrix proofs into sequent-style systems
Controlled integration of the cut rule into connection tableau calculi
Knowledge-based proof planning
Connection-based proof construction in linear logic
Reduction rules for resolution-based systems
scientific article; zbMATH DE number 7204450 (Why is no real title available?)
Towards a unified model of search in theorem-proving: subgoal-reduction strategies
Automated theorem proving methods
A comparative study of several proof procedures
Connection methods in linear logic and proof nets construction
Proof-search in type-theoretic languages: An introduction
Converting non-classical matrix proofs into sequent-style systems

This page was built for publication: On Matrices with Connections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922205)