The following pages link to (Q3327746):
Displaying 26 items.
- Mathematical model and implementation of rational processing (Q313681) (← links)
- Specifying rewrite strategies for interactive exercises (Q626940) (← links)
- Geometric construction by assembling solved subfigures (Q1128611) (← links)
- A theory of abstraction (Q1199923) (← links)
- Syntactical treatments of propositional attitudes (Q1275601) (← links)
- Gentzen-type systems, resolution and tableaux (Q1311413) (← links)
- Annotations in formal specifications and proofs (Q1334901) (← links)
- Purposive discovery of operators (Q1356174) (← links)
- Using tactics to reformulate formulae for resolution theorem proving (Q1380410) (← links)
- Abstract argumentation systems (Q1402750) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- The structure-mapping engine: Algorithm and examples (Q1823718) (← links)
- Proof by analogy in mural (Q1898818) (← links)
- The natural algorithmic approach of mixed trigonometric-polynomial problems (Q2012330) (← links)
- A logic-based model of intention formation and action for multi-agent subcontracting (Q2457680) (← links)
- Computer-aided heuristic analysis of fluid models (Q2564104) (← links)
- The interval representation problem (Q3361921) (← links)
- (Q4263839) (← links)
- The Logical Structure of Computer-Aided Mathematical Reasoning (Q4373335) (← links)
- (Q4730771) (← links)
- Uniform and non uniform strategies for tableaux calculi for modal logics (Q4835516) (← links)
- It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair (Q5096169) (← links)
- The search efficiency of theorem proving strategies (Q5210762) (← links)
- An automatic proof of Gödel's incompleteness theorem (Q5906916) (← links)
- Semantical analysis of the logic of bunched implications (Q6115849) (← links)
- Reductive logic, proof-search, and coalgebra: a perspective from resource semantics (Q6612799) (← links)
