scholarly journals Interactive and probabilistic proof-checking

2000 ◽  
Vol 104 (1-3) ◽  
pp. 325-342 ◽  
Author(s):  
Luca Trevisan
Keyword(s):  
Proof Checking ◽  
Probabilistic Proof

Parametric bridge design – reinforcement design

2021 ◽  
Author(s):  
Jaroslav Navrátil ◽  
Petr Ševčík ◽  
Johann Stampler ◽  
Gregor Strekelj
Keyword(s):  
Construction Industry ◽  
Design Process ◽  
Prestressed Concrete ◽  
Planning Process ◽  
Analysis Model ◽  
Bridge Design ◽  
Proof Checking ◽  
Challenging Tasks ◽  
Stress States ◽  
Reinforcement Design

<p>Using BIM technology for the design process in the construction industry has become somewhat of a standard approach. For bridge design, various solutions offering geometric design functionality and data management facilities are available on the market. However, integrated solutions for seamlessly supporting the whole planning process are still a scarce commodity. The solution presented integrates architectural modeling, structural analysis, and sophisticated proof checking functionality in one package, where, based on a 4D architectural model, an analysis model is automatically derived, allowing for simulating the erection process in detail and investigating all relevant stress states. The focus of the paper is the reinforcement design of prestressed concrete sections, which is one of the most challenging tasks among the various requirements arising in the design process.</p>

scholarly journals Reliable Reconstruction of Fine-grained Proofs in a Proof Assistant

2021 ◽  
pp. 450-467
Author(s):  
Hans-Jörg Schurr ◽  
Mathias Fleury ◽  
Martin Desharnais
Keyword(s):  
Success Rate ◽  
Failure Rate ◽  
Proof Assistant ◽  
Proof Checking ◽  
Smt Solver ◽  
Fine Grained ◽  
Simple Rules ◽  
Detailed Evaluation ◽  
Reconstruction Time

AbstractWe present a fast and reliable reconstruction of proofs generated by the SMT solver veriT in Isabelle. The fine-grained proof format makes the reconstruction simple and efficient. For typical proof steps, such as arithmetic reasoning and skolemization, our reconstruction can avoid expensive search. By skipping proof steps that are irrelevant for Isabelle, the performance of proof checking is improved. Our method increases the success rate of Sledgehammer by halving the failure rate and reduces the checking time by 13%. We provide a detailed evaluation of the reconstruction time for each rule. The runtime is influenced by both simple rules that appear very often and common complex rules.

scholarly journals A Formalism for Primitive Logic and Mechanical Proof-Checking

1966 ◽  
Vol 26 ◽  
pp. 195-203 ◽  
Author(s):  
Katuzi Ono
Keyword(s):  
Simple Form ◽  
Predicate Logic ◽  
View Point ◽  
Proof Checking ◽  
Mechanical Proof ◽  
Classical Predicate

The universal character of the primitive logic LO in the sense that popular logics such as the lower classical predicate logic LK, the intuitionistic predicate logic LJ, Johansson’s minimal predicate logic LM, etc. can be faithfully interpreted in LO is very remarkable even from the view point of mechanical proof-checking. Since LO is very simple, deductions in LO could be mechanized in a simple form if a suitable formalism for LO is found out. Main purpose of this paper is to introduce a practical formalism for LO, practical in the sense that it is suitable at least for mechanical proof-checking business.

Sign in / Sign up

Export Citation Format

Share Document