Filters








226 Hits in 3.8 sec

AVATAR: The Architecture for First-Order Theorem Provers [chapter]

Andrei Voronkov
2014 Lecture Notes in Computer Science  
However, even with various versions of splitting, the performance of superposition theorem provers is nowhere near SMT solvers on variable-free problems or SAT solvers on propositional problems.  ...  Nearly all problems solved with one of 481 variants of splitting previously implemented in Vampire can also be solved with AVATAR.  ...  The SAT and the SMT solvers implemented in Vampire are very simple and much weaker than best SAT and SMT solvers.  ... 
doi:10.1007/978-3-319-08867-9_46 fatcat:jpi5e5ag4nbyxljltjtgxf55na

Playing with AVATAR [chapter]

Giles Reger, Martin Suda, Andrei Voronkov
2015 Lecture Notes in Computer Science  
This paper considers the new AVATAR (Advanced Vampire Architecture for Theories And Resolution) approach to splitting which places a SAT (or SMT) solver at the centre of the theorem prover and uses it  ...  One approach that has proved successful in taming the search space is splitting where clauses are split into components with disjoint variables and the components are asserted in turn.  ...  In 8.8% of the experiments, calls to the SAT solver took more than 50% of the time and in 0.5% of the experiments calls to the SAT solver took more than 90% of the time 5 .  ... 
doi:10.1007/978-3-319-21401-6_28 fatcat:qelxxzlrvbhjlmsujj6vxbewwu

Testing a Saturation-Based Theorem Prover: Experiences and Challenges [chapter]

Giles Reger, Martin Suda, Andrei Voronkov
2017 Lecture Notes in Computer Science  
This paper attempts to address the question of how best to assure the correctness of saturation-based automated theorem provers using our experience with developing the theorem prover Vampire.  ...  We describe the techniques we currently employ to ensure that Vampire is correct and use this to motivate future challenges that need to be addressed to make this process more straightforward and to achieve  ...  -SAT and SMT solving. Vampire makes use of SAT and SMT solvers in various ways (see [18] ).  ... 
doi:10.1007/978-3-319-61467-0_10 fatcat:x7cutte3jrb6tijcmyozrkjysq

Bound Propagation for Arithmetic Reasoning in Vampire

Ioan Dragan, Konstantin Korovin, Laura Kovacs, Andrei Voronkov
2013 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing  
We evaluate our implementation on a large number of examples and compare it with state-of-the-art SMT solvers.  ...  The implementation is part of the first-order theorem prover Vampire. The input problems are systems of linear inequalities over reals or rationals.  ...  When compared to state-of-the-art SMT solvers, our experiments show encouraging results.  ... 
doi:10.1109/synasc.2013.30 dblp:conf/synasc/DraganKKV13 fatcat:ddaewur2hrayfcytrvh4rkuxuu

Testing a Saturation-Based Theorem Prover: Experiences and Challenges (Extended Version) [article]

Giles Reger and Martin Suda and Andrei Voronkov
2017 arXiv   pre-print
This paper attempts to address the question of how best to assure the correctness of saturation-based automated theorem provers using our experience developing the theorem prover Vampire.  ...  We describe the techniques we currently employ to ensure that Vampire is correct and use this to motivate future challenges that need to be addressed to make this process more straightforward and to achieve  ...  This cannot (in principle) be checked by the described approach and requires a non-trivial extension. SAT and SMT solving. Vampire makes use of SAT and SMT solvers in various ways (see [11] ).  ... 
arXiv:1704.03391v1 fatcat:oq3ex3t2bvhilkvb55aoozwbxa

The SMT Competition 2015–2018

Tjark Weber, Sylvain Conchon, David Déharbe, Matthias Heizmann, Aina Niemetz, Giles Reger, Luca Pulina, Martina Seidl
2019 Journal on Satisfiability, Boolean Modeling and Computation  
Internally, many SMT solvers employ SAT solving techniques to deal with the propositional structure of the formula, and combine these with (semi-)decision procedures for the background theories that the  ...  With its rich input language, SMT has applications in software engineering, optimization, and many other areas [23] .  ...  developers who entered their solver into the competition.  ... 
doi:10.3233/sat190123 fatcat:k4tezwrthrcjdl3g25sampbooe

Reachability Analysis for AWS-Based Networks [chapter]

John Backes, Sam Bayless, Byron Cook, Catherine Dodge, Andrew Gacek, Alan J. Hu, Temesghen Kahsai, Bill Kocik, Evgenii Kotelnikov, Jure Kukovec, Sean McLaughlin, Jason Reed (+7 others)
2019 Lecture Notes in Computer Science  
Tiros is the foundation of a recently introduced network security analysis feature in the Amazon Inspector service now available to millions of customers building applications in the cloud.  ...  In this industrial case-study, we describe a new network reachability reasoning tool, called Tiros, that uses off-the-shelf automated theorem proving tools to fill this need.  ...  In our experiments with Vampire, we found that the first order logic encoding we used does not scale well.  ... 
doi:10.1007/978-3-030-25543-5_14 fatcat:cs4tezb2trb7nff6ragcqxzea4

Subsumption Demodulation in First-Order Theorem Proving [article]

Bernhard Gleiss, Laura Kovacs, Jakob Rath
2020 arXiv   pre-print
We implemented subsumption demodulation in the theorem prover Vampire, by extending Vampire with a new clause index and adapting its multi-literal matching component.  ...  Our experiments, using the TPTP and SMT-LIB repositories, show that subsumption demodulation in Vampire can solve many new problems that could so far not be solved by state-of-the-art reasoners.  ...  Configuration Total Solved New (SAT+UNSAT) VAMPIRE 13,924 9,923 - VAMPIRE, with FSD 13,924 9,757 20 (3+17) VAMPIRE, with BSD 13,924 9,797 14 (2+12) VAMPIRE, with FSD and BSD 13,924 9,734 30  ... 
arXiv:2001.10213v1 fatcat:mlqi3hptvnflfchhkhp55w25py

BoSy: An Experimentation Framework for Bounded Synthesis [article]

Peter Faymonville and Bernd Finkbeiner and Leander Tentrup
2018 arXiv   pre-print
BoSy constructs bounded synthesis encodings into SAT, QBF, DQBF, EPR, and SMT, and interfaces to solvers of the corresponding type.  ...  In addition to its use as a synthesis tool, BoSy can also be used as an experimentation and performance evaluation framework for various types of satisfiability solvers.  ...  In our experiments, the QBF solvers nevertheless outperform the currently available DQBF solvers.  ... 
arXiv:1803.09566v1 fatcat:l5ul2pov4zeprjzqi7gpteglni

BoSy: An Experimentation Framework for Bounded Synthesis [chapter]

Peter Faymonville, Bernd Finkbeiner, Leander Tentrup
2017 Lecture Notes in Computer Science  
BoSy constructs bounded synthesis encodings into SAT, QBF, DQBF, EPR, and SMT, and interfaces to solvers of the corresponding type.  ...  In addition to its use as a synthesis tool, BoSy can also be used as an experimentation and performance evaluation framework for various types of satisfiability solvers.  ...  In our experiments, the QBF solvers nevertheless outperform the currently available DQBF solvers.  ... 
doi:10.1007/978-3-319-63390-9_17 fatcat:htg6svjhvrelboczezrfsq5gty

Interactive Visualization of Saturation Attempts in Vampire [chapter]

Bernhard Gleiss, Laura Kovács, Lena Schnedlitz
2019 Lecture Notes in Computer Science  
To improve the performance of automated reasoning engines, such as SAT/SMT solvers and first-order theorem prover, it is necessary to understand both the successful and failing attempts of these engines  ...  We build SATVIS on top of the world-leading theorem prover VAMPIRE, by interactively visualizing the saturation attempts of VAMPIRE in SATVIS.  ...  Automated reasoners, such as SAT/SMT solvers [1, 5] and first-order theorem provers [9, 13] , have therefore become a key backbone of rigorous system engineering.  ... 
doi:10.1007/978-3-030-34968-4_28 fatcat:oqysh5j5znd7jmcffil6u6zqxy

Subsumption Demodulation in First-Order Theorem Proving [chapter]

Bernhard Gleiss, Laura Kovács, Jakob Rath
2020 Lecture Notes in Computer Science  
We implemented subsumption demodulation in the theorem prover Vampire, by extending Vampire with a new clause index and adapting its multi-literal matching component.  ...  Our experiments, using the TPTP and SMT-LIB repositories, show that subsumption demodulation in Vampire can solve many new problems that could so far not be solved by state-of-the-art reasoners.  ...  Vampire, with FSD and BSD 13,924 9,734 30 (6 + 24) Configuration Total Solved New (SAT + UNSAT) Vampire 13,924 9,923 - Vampire, with FSD 13,924 9,757 20 (3 + 17) Vampire, with BSD 13,924 9,797 14  ... 
doi:10.1007/978-3-030-51074-9_17 fatcat:l3bzolwqqvbb5n2w7vkg2ay7vm

Finding Finite Models in Multi-Sorted First Order Logic [article]

Giles Reger, Martin Suda, Andrei Voronkov
2016 arXiv   pre-print
Evaluation of an implementation of techniques in the Vampire theorem prover shows that they dramatically reduce the search space and that this is an effective approach to find finite models in multi-sorted  ...  The key approach adds additional information to the SAT encoding to suggest which domains should be grown.  ...  This encoding uses information from the SAT solver to guide the search through the space of domain size assignments. 2.  ... 
arXiv:1604.08040v1 fatcat:3mwe45k45fb5lefbu53sfouupi

Automatic Proof and Disproof in Isabelle/HOL [chapter]

Jasmin Christian Blanchette, Lukas Bulwahn, Tobias Nipkow
2011 Lecture Notes in Computer Science  
Together with the Isar structured proof format and a new asynchronous user interface, these tools have radically transformed the Isabelle user experience.  ...  compiler as a fast evaluator for ground formulas, and its rival Nitpick is based on the model finder Kodkod, which performs a reduction to SAT.  ...  in the SAT encoding.  ... 
doi:10.1007/978-3-642-24364-6_2 fatcat:y4crzmmegfhybfp5xu2bwlxoae

Boldly Going Where No Prover Has Gone Before

Giles Reger
2019 Electronic Proceedings in Theoretical Computer Science  
We propose a movement towards focussing on unique solutions in evaluation and competitions i.e. measuring the potential contribution to a portfolio solver.  ...  We acknowledge that forcing new methods to compete against portfolio solvers can stifle innovation. However, this is only the case when comparisons are made at the level of total problems solved.  ...  in competitions (CASC and SMT-COMP) over the last few years (this experiment consists of significantly more than 10 million runs of Vampire).  ... 
doi:10.4204/eptcs.311.6 fatcat:e2mofcpky5birjcdbkpulkeiei
« Previous Showing results 1 — 15 out of 226 results