The following pages link to On Matrices with Connections (Q3922205):
Displayed 20 items.
- A logical framework for depiction and image interpretation (Q582146) (← links)
- Linearity and regularity with negation normal form (Q703486) (← links)
- The disconnection tableau calculus (Q877889) (← links)
- On connections and higher-order logic (Q908896) (← links)
- Automated theorem proving methods (Q1057850) (← links)
- A new reduction rule for the connection graph proof procedure (Q1114445) (← links)
- Reduction rules for resolution-based systems (Q1187214) (← links)
- A new subsumption method in the connection graph proof procedure (Q1199542) (← links)
- A kind of logical compilation for knowledge bases (Q1331921) (← links)
- Controlled integration of the cut rule into connection tableau calculi (Q1344875) (← links)
- On the termination of clause graph resolution (Q1344889) (← links)
- Combining formal derivation search procedures and natural theorem proving techniques in an automated theorem proving system (Q1364068) (← links)
- Connection methods in linear logic and proof nets construction (Q1575926) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- A comparative study of several proof procedures (Q1836483) (← links)
- A uniform procedure for converting matrix proofs into sequent-style systems (Q1854382) (← links)
- A typed resolution principle for deduction with conditional typing theory (Q1855225) (← links)
- Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem (Q1960430) (← links)
- Knowledge-based proof planning (Q1978469) (← links)
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)