Relaxed Weighted Path Order in Theorem Proving
نویسندگان
چکیده
منابع مشابه
Higher-Order Automated Theorem Proving
The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification...
متن کاملFirst-order theorem proving modulo equations
We present refutationally complete calculi for first-order clauses with equality. General paramodulation calculi cannot efficiently deal with equations such as associativity and commutativity axioms. Therefore we will separate a set of equations (called E-equations) from a specification and give them a special treatment, avoiding paramodulations with E-equations but using E-unification for the ...
متن کاملFirst-Order Theorem Proving and Vampire
In this paper we give a short introduction in first-order theorem proving and the use of the theorem prover VAMPIRE. We discuss the superposition calculus and explain the key concepts of saturation and redundancy elimination, present saturation algorithms and preprocessing, and demonstrate how these concepts are implemented in VAMPIRE. Further, we also cover more recent topics and features of V...
متن کاملHigher - Order Automated Theorem Proving for NaturalLanguage
This paper describes a tableau-based higher-order theorem prover Hot and an application to natural language semantics. In this application, Hot is used to prove equivalences using world knowledge during higher-order uniication (HOU). This extended form of HOU is used to compute the licensing conditions for corrections.
متن کاملApplication Specific Higher Order Logic Theorem Proving
Theorem proving allows the formal verification of the correctness of very large systems. In order to increase the acceptance of theorem proving systems during the design process, we implemented higher order logic proof systems for ANSI-C and Verilog within a framework for application specific proof systems. Furthermore, we implement the language of the PVS theorem prover as well-established hig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics in Computer Science
سال: 2020
ISSN: 1661-8270,1661-8289
DOI: 10.1007/s11786-020-00474-0