Pages that link to "Item:Q3906484"
From MaRDI portal
The following pages link to Theorem Proving via General Matings (Q3906484):
Displayed 33 items.
- The undecidability of simultaneous rigid E-unification (Q671659) (← links)
- Theory matrices (for modal logics) using alphabetical monotonicity (Q687154) (← links)
- Linearity and regularity with negation normal form (Q703486) (← links)
- Optimizing the clausal normal form transformation (Q809622) (← links)
- TPS: A hybrid automatic-interactive system for developing proofs (Q865629) (← links)
- The disconnection tableau calculus (Q877889) (← links)
- Liberalized variable splitting (Q877894) (← links)
- On connections and higher-order logic (Q908896) (← links)
- Rigid E-unification: NP-completeness and applications to equational matings (Q921913) (← links)
- Automated theorem proving methods (Q1057850) (← links)
- A decidable fragment of predicate calculus (Q1066880) (← links)
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler (Q1114446) (← links)
- Complexity of resolution proofs and function introduction (Q1194246) (← links)
- A new subsumption method in the connection graph proof procedure (Q1199542) (← links)
- On an unsatisfiability-satisfiability prover (Q1264000) (← links)
- Representing scope in intuitionistic deductions (Q1274448) (← links)
- Universal abstract consistency class and universal refutation (Q1288438) (← links)
- Accelerating tableaux proofs using compact representations (Q1334905) (← links)
- On the termination of clause graph resolution (Q1344889) (← links)
- Embedding complex decision procedures inside an interactive theorem prover. (Q1353946) (← links)
- A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation (Q1354059) (← links)
- Combining formal derivation search procedures and natural theorem proving techniques in an automated theorem proving system (Q1364068) (← links)
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636) (← links)
- Connection methods in linear logic and proof nets construction (Q1575926) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- Higher-order unification revisited: Complete sets of transformations (Q1823936) (← links)
- A comparative study of several proof procedures (Q1836483) (← links)
- Practically useful variants of definitional translations to normal form (Q1854384) (← links)
- TPS: A theorem-proving system for classical type theory (Q1923825) (← links)
- Structured proof procedures (Q1924823) (← links)
- Knowledge-based proof planning (Q1978469) (← links)
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)
- Protocol Verification Via Rigid/Flexible Resolution (Q3498469) (← links)