Automated Theorem Proving: After 25 Years

DOI10.1090/CONM/029MaRDI QIDQ3335722zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1984

Published in Contemporary Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/conm/029

zbMATH Keywords

Automated theorem provingProceedingsTheorem provingMeetingDenver/ColoradoAmerican Mathematical Society

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Conference proceedings and collections of articles (00Bxx)

Cited in

(17)

• A formal proof of the deadline driven scheduler in PPTL axiomatic system
• A complete proof system for propositional projection temporal logic
• Automated inferencing
• A mechanical proof of the Church-Rosser theorem
• A method for simultaneous search for refutations and models by equational constraint solving
• Increasing the efficiency of automated theorem proving
• Automated deduction
• Verification of distributed systems with the axiomatic system of MSVL
• A logic-based model of intention formation and action for multi-agent subcontracting
• History and prospects for first-order automated deduction
• A complete axiom system for propositional projection temporal logic with cylinder computation model
• A refutational approach to geometry theorem proving
• Geometry machines: from AI to SMC
• A method for building models automatically. Experiments with an extension of OTTER
• Wu's method and its application to perspective viewing
• Syntactical treatments of propositional attitudes
• Proof-checking Euclid

This page was built for publication: Automated Theorem Proving: After 25 Years

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