scientific article; zbMATH DE number 3860434

MaRDI QIDQ3327746zbMATH OpenFDO

Authors Alan Bundy

Publication date 1983

zbMATH Keywords

concept formationknowledge representationMathematical reasoningproof proceduresResolution

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Cited in

(32)

• Geometric construction by assembling solved subfigures
• A theory of abstraction
• Syntactical treatments of propositional attitudes
• Gentzen-type systems, resolution and tableaux
• Annotations in formal specifications and proofs
• Purposive discovery of operators
• Using tactics to reformulate formulae for resolution theorem proving
• Abstract argumentation systems
• Proof-search in type-theoretic languages: An introduction
• The structure-mapping engine: Algorithm and examples
• Proof by analogy in mural
• The natural algorithmic approach of mixed trigonometric-polynomial problems
• Lakatos-style collaborative mathematics through dialectical, structured and abstract argumentation
• A logic-based model of intention formation and action for multi-agent subcontracting
• Computer-aided heuristic analysis of fluid models
• Mathematical model and implementation of rational processing
• The interval representation problem
• scientific article; zbMATH DE number 3904000 (Why is no real title available?)
• scientific article; zbMATH DE number 1342253 (Why is no real title available?)
• scientific article; zbMATH DE number 622663 (Why is no real title available?)
• The Logical Structure of Computer-Aided Mathematical Reasoning
• scientific article; zbMATH DE number 4115950 (Why is no real title available?)
• Uniform and non uniform strategies for tableaux calculi for modal logics
• Artificial mathematical intelligence. Cognitive, (meta)mathematical, physical and philosophical foundations
• It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair
• The search efficiency of theorem proving strategies
• An automatic proof of Gödel's incompleteness theorem
• Semantical analysis of the logic of bunched implications
• Specifying rewrite strategies for interactive exercises
• Mathematical reasoning and the computer
• Reductive logic, proof-search, and coalgebra: a perspective from resource semantics
• Interest driven suppositional reasoning

This page was built for publication:

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