1 / 8

Encapsulation for Practical Simplification Procedures

Encapsulation for Practical Simplification Procedures. Olga Shumsky Matlin & William McCune Mathematics and Computer Science Division Argonne National Laboratory {matlin,mccune}@mcs.anl.gov. Problem Origin. First-order resolution and paramodulation theorem prover OTTER

rafer
Télécharger la présentation

Encapsulation for Practical Simplification Procedures

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Encapsulation for Practical Simplification Procedures Olga Shumsky Matlin & William McCune Mathematics and Computer Science Division Argonne National Laboratory {matlin,mccune}@mcs.anl.gov

  2. Problem Origin • First-order resolution and paramodulation theorem prover OTTER • Interdependent data structures and algorithms, performance concerns • Sometimes impossible to use the simplest algorithm to solve a particular problem • Procedures for incorporating newly derived clauses into the main database • Term rewriting and demodulation are at the core of the incorporation procedures Matlin & McCune --- Encapsulation for Practical Simplification Procedures

  3. back subsumption and rewriting forward subsumption and rewriting Simple Solution: Direct Incorporation if (C1´ ≠ TRUE) find Di  S, rewritable by C1´ Database S D3 D1 C1´ D2 to show termination: enqueue Di´= simplify Di by C1´ C1´ = simplify C1 by S Unincorporated Clauses Q C1 C2 C3 ... Cn Matlin & McCune --- Encapsulation for Practical Simplification Procedures

  4. Limbo Incorporation Database S D3 D1 find Di  S, rewritable by C1´ D2 Di´ = simplify Di by (S-Di+L) Limbo List L C1 ´ C2 ´ C3 ´ ... Cn ´ D1 ´ D2 ´ D3 ´ Ci´= simplify Ci by (S+L) Unincorporated Clauses Q C1 C2 C3 ... Cn Matlin & McCune --- Encapsulation for Practical Simplification Procedures

  5. Verification Goals • Termination of both procedures • in practice, implementation of the simplification function (term rewriting) contains an artificial stopping condition • in practice, termination of the simplification procedure is assumed • Database is irreducible • no element is rewritable by any other element • Procedures produce equivalent databases • order of rewriting is different, does not produce canonical forms • no guarantee that database will contain the same elements • show equivalence with respect to evaluation, sufficient to show that each procedure preserves evaluation of the conjunction of clauses in the original database and queue Matlin & McCune --- Encapsulation for Practical Simplification Procedures

  6. Key Observations • Simplification is via term rewriting • Rewriting function terminates, rewrites as much as possible, simplifies, is sound, other details unimportant • Details of the evaluation function unimportant • Encapsulate simplification and evaluation functions • Termination of direct incorporation depends on slight modification of the procedure • Measure function based on a special count function: (cons (+ 1 (count q) (count s)) (+ 1 (count q))) • Property for irreducibility proof for limbo incorporation  A,B  L, pos(A) < pos(B) →A does not rewrite B Matlin & McCune --- Encapsulation for Practical Simplification Procedures

  7. Solution Statistics • 4 constrained functions • simplify, ceval, scount, true-symbolp • 8 properties of constrained functions • 20 functions to model the procedures and correctness properties, including auxiliary functions • 89 theorems proved, 28 hints required • 2 main irreducibility, 2 main soundness theorems Matlin & McCune --- Encapsulation for Practical Simplification Procedures

  8. Related Work • IVY project (ACL2 Case Studies) • Verification of the same software • IVY checked soundness of OTTER proofs • Errors in incorporation procedures could lead OTTER to miss some or all proofs • Difficulties in formalization of the evaluation function encouraged the use of encapsulation in this project • J. L. Ruiz Reina, J. A. Alonso, M. J. Hidalgo, and F. J. Martín. Formal proofs about rewriting using ACL2. Annals of Mathematics and Artificial Intelligence, 36(3):239--262, 2002. • Formalization of basic reduction and simplification procedures and their properties • Our project takes both for granted Matlin & McCune --- Encapsulation for Practical Simplification Procedures

More Related