type formula (form) val elim all neg : form -> form ... type substitution (subs) type constraints (csts) val unif : csts -> form -> csts -> form -> int * subs * csts * form ...
A universal prover Patrick Th´ evenon, PhD Student Universit´ e de Savoie,Chamb´ ery Laboratoire de math´ ematiques,LAMA
Introduction
• Aim : having a prover able to deal with – any logic given (Universal prover) – Hints given to guide the proof • Main features : – Functor – Inverse resolution – Clauses balanced by weights
The prover as a functor module Prover : functor (Logic : Logic) -> sig Exception Prove fails val prove : ( formula * int * constraints) list -> formula -> unit (* raises Prove fails when no proof is found *) end
To have a prover : – give a logic – apply the functor to it.
Logic required module type Logic = sig type formula (form) val elim all neg : form -> form ... type substitution (subs) type constraints (csts) val unif : csts -> form -> csts -> form -> int * subs * csts * form * form list val get rules : csts -> form -> bool -> (string * int * subs * csts * form list ) list end
Architecture
Clauses Already Seen
C
All resolutions Between clauses
Cdt
Candidate Clauses
C and clause Cdt add new candidates
Increasing weight
Decomposition and resolution
Inverse resolution : a clause is a set of literals, which are formulas that are not necessarily atomic. Lazy decomposition : formulas are seen as black boxes, and decomposed only when a subformula can be unified with an other literal. Decomposing formulas can be seen as making resolution with rule clauses...
... Example : Let {F ⊥ , Γ} be a clause with F = (A → B) From F ↔ (A → B) we obtain two clauses : {A, Γ} and {B ⊥ , Γ} It can be seen as resolutions with the following clauses on the literal F ≡ X1 → X2 : {X1 , X1 → X2 } and {X2⊥, X1 → X2} → Decomposing is making resolution with rule clauses. → get rules asks for each formula which rules can be applied.
The constraints For each unification - applying rules or making resolutions - constraints may be given and used. Examples : 1. Skolemization : Decomposing ∃x.P (x), Make a clause with P (x), x a new variable with a constraint saying that x depends only on the free variables of P . This avoids the use of the choice axiom for higher order logic. 2. Contraction : Contracting C = {A, A0, Γ}, add a constraint A 6= A0 in C, to avoid possibly subsumption with clauses coming from {Aσ, Γσ}. 3. Intuitionistic logic ? 4. Linear logic ?
Dealing with Hints H := A ∧ B H0 := A → C H1 := D ` C By H0 and H trivial. Hypotheses have a lighter weight when they are named.
H := ∀x.B(x) H0 := C(x0) ` ∃x.B(x) ∧ C(x) By H with x = x0, by H0 trivial. The hint x = x0 can be given as a constraint. A unification that changes x into x0 has a lighter weight.
Conclusion
A very young prover that • needs great improvements but • may offer a good solution for the DemoNat project
Mécanique. ➢ Physique .... La machine (électro-mécanique) de H. Aiken (1943). Elle pesait 5 tonnes .... Ordinateurs à base moléculaire. Adleman a construit un ...
Pourquoi traquer les bugs, c'est difficile ? 5. Qu'est ce que l'absence de bug ? 6. Les solutions actuelles. 7. Logiciels et preuves mathématiques. 8. Conclusion.
It can also be seen as an introduction to the more elaborate case 2.(a). For case 2.(b) we give examples of terms F for which there is no term having this property. 1.3 A final remark. Note that, actually, even if a term A having the Barendregt's per
(Universal Digital Logic Interface). DAC08. One Technology Way ... motor and pen drivers, waveform generators, audio encoders and attenuators, analog meter ...
Lettres, langues, Arts et Sciences Humaines, responsable des cours de ... numérique aux étudiants fréquentant les cours de français langue étrangère de la ...
11 sept. 2019 - Stephen Charles Brown Timekeeper, Ryan Pratt Scorer, Cam. Eggeman. Goals By Period ... 18 Fiona Blanchard. 0. 0. 0. 0. 21 Brianna Cota. 0.
Beachten Sie die nationalen Vorschriften zum Personen-,Gewässer- und Bodenschutz. Gemäß ISO 14001 (Anhang I, A.4.7. Notfallvorsorge und -maßnahmen) ...
This. Zoom Sur Savoie Mont Blanc Savoie Et Haute Savoie PDF on the files/S3Library-89d94-C8db5-F1b25-B949c-2c79b.pdf file begin with Intro, Brief Discussion until the. Index/Glossary page, look at the table of content for additional information, if p
Required amount of oil-binding agent. 6.25 kg. 100 kg. Disposal volume. 96.25 kg. 190 kg. 4.1 Product design. Matting. Absorbent mats are ideal for smaller ...
1 Sur le concept d'auto-transcendance du sens, voir J-H. Barthélémy ...... temporalisation constitutive de la personnalité psycho-sociale, pensée qui prend place ...
UFR Sciences Fondamentales et Appliquées. (SFA) .... Universitaire des Activités Physiques et Sportives – offre à tous les étudiants, quel que soit ... techniques !
For example, an interface-design tool could output an XIML interface specification that can then be used at runtime for the management of interaction, and.
31 juil. 2017 - d'une famille de Damas en Syrie, en pleine guerre. Une famille parmi d'autres qui fait ce qu'elle peut pour continuer à vivre, au jour le jour.