The Philosophy of Automated Theorem Proving
نویسنده
چکیده
ph i losoph ica l level i t addresses the quest ion of whether var ious practi t ioners of automated theorem prov ing have a coherent posi t ion. Consider a person who argues that natural deduct ion is better than resolution-based systems, e.g., Bledsoe (1971) or Pelletier (1982). Whyever wou ld a person be even tempted to argue this unless he thought that the goal of automated theorem prov ing was to approach "the real sys tem" — that is, unless he were a Realist. Af ter a l l , it is patent ly obv ious that T H I N K E R is better at emulat ing proofs in the KM system than any reso lu t ion-emulat ing system; and that any resolut ion-emulat ing system is better than T H I N K E R at producing proofs of a resolution system. The same sort of Real ist reasoning must have been in Wang 's m i n d when he inveighed against the Logic Theorist and in favour of h is consecution-style method (Wang 1960, p.246). But not everyone seems to be a Real ist in this sense. These who , l i ke the designers of the Logic Theorist, bel ieve that they are invest igat ing how people reason in the context of a g i ven system ( s tudy ing subs t i tu t ion in to par t icu lar ax ioms, reasoning backward f r o m certain goals dictated by part icular ax ioms, and the l i ke) can be taken to be Nomina l i s ts — at least insofar as they wou ld be qu i t e unconcerned w i t h the results of a system where proofs take a dif ferent f o rm. A n d I have spoken w i t h various practit ioners in the f ie ld who wou ld vehement ly deny the existence of any
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملDistributed Automated Deduction
of the Dissertation Distributed Automated Deduction by Maria Paola Bonacina Doctor of Philosophy in Computer Science State University of New York at Stony Brook 1992 This thesis comprises four main contributions: an abstract framework for theorem proving, a methodology for parallel theorem proving in a distributed environment, termed deduction by Clause-Diffusion, a study of special topics in d...
متن کاملLakatos-Style Automated Theorem Modification
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieved through an interaction of the HR machine learning system, the Otter theorem prover and the Mace model generator, and uses methods inspired by Lakatos’s philosophy of mathematics. We demonstrate the effectiveness of ...
متن کاملAutomated Reasoning for Robot Ethics
Deontic logic is a very well researched branch of mathematical logic and philosophy. Various kinds of deontic logics are considered for different application domains like argumentation theory, legal reasoning, and acts in multi-agent systems. In this paper, we show how standard deontic logic can be used to model ethical codes for multi-agent systems. Furthermore we show how Hyper, a high perfor...
متن کاملA (Very) Brief History of Artificial Intelligence
telligence are traced to philosophy, fiction, and imagination. Early inventions in electronics, engineering, and many other disciplines have influenced AI. Some early milestones include work in problems solving which included basic work in learning, knowledge representation, and inference as well as demonstration programs in language understanding, translation, theorem proving, associative memo...
متن کاملAutomating Gödel's Ontological Proof of God's Existence with Higher-order Automated Theorem Provers
Kurt Gödel’s ontological argument for God’s existence has been formalized and automated on a computer with higher-order automated theorem provers. From Gödel’s premises, the computer proved: necessarily, there exists God. On the other hand, the theorem provers have also confirmed prominent criticism on Gödel’s ontological argument, and they found some new results about it. The background theory...
متن کامل