Abstract Theorem Proving
نویسندگان
چکیده
Informally, a b s t r a c t i o n can be described as the process of mapping a representation of a problem into a new representation. The aim of the paper is to propose a theory of abstrac t ion. The generality of the framework is tested by formalizing and analyzing some work done in the past; i ts efficacy by giving a procedure which solves the '' false proof problem by avoid ing the use of inconsistent abstract spaces.
منابع مشابه
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...
متن کاملSearch Strategies for Theorem - Proving
We will define the notions of abstract theorem-proving graph, abstract theorem-proving problem g and search strategy E for g. These concepts generalize the usual tree (or graph) searching problem and admit Hart, Nilsson and Raphael (1968) and Pohl (1969) theories of heuristic search. In particular the admissibility and optimality theorems of Hart, Nilsson and Raphael generalize for the classes ...
متن کاملAnalysis and transformation of proof procedures
Automated theorem proving has made great progress during the last few decades. Proofs of more and more diicult theorems are being found faster and faster. However, the exponential increase in the size of the search space remains for many theorem proving problems. Logic program analysis and transformation techniques have also made progress during the last few years and automated theorem proving ...
متن کامل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...
متن کاملThe Term Rewriting Approach to Automated Theorem Proving
Reasoning about equality has been one of the most challenging problems in automated deduction. In the past thirty years, a number of methods have been proposed. In this survey, we give an overview of one of the more successful approaches, the term rewriting method. Term rewriting was first proposed by Evans [381 and Knuth-Bendix [93]. Its original purpose was for generating canonical term rewri...
متن کاملSaturation-Based Theorem Proving: Past Successes and Future Potential (Abstract)
A resolution theorem prover for intuitionistic logic p. 2 Proof-terms for classical and intuitionistic resolution p. 17 Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-Unification p. 32 Extensions to a generalization critic for inductive proof p. 47 Learning domain knowledge to improve theorem proving p. 62 Patching faulty conjectures p. 77 Internal analogy i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989