Efficient Instantiation Techniques in SMT (Work In Progress)

Haniel Barbosa (1, 2, 3)

1 UFRN - Universidade Federal do Rio Grande do Norte [Natal]
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
3 MOSEL - Proof-oriented development of computer-based systems

In SMT solving one generally applies heuristic instantiation to handle quantified formulas. This has the side effect of producing many spurious instances and may lead to loss of performance. Therefore deriving both fewer and more meaningful instances as well as eliminating or dismissing , i.e., keeping but ignoring, those not significant for the solving are desirable features for dealing with first-order problems. This paper presents preliminary work on two approaches: the implementation of an efficient instantiation framework with an incomplete goal-oriented search; and the introduction of dismissing criteria for heuristic instances. Our experiments show that while the former improves performance in general the latter is highly dependent on the problem structure, but its combination with the classic strategy leads to competitive results w.r.t. state-of-the-art SMT solvers in several benchmark libraries.

Mots clés: smt; instantiation; quantifiers

Domaines: Intelligence artificielle [cs.AI]; Logique en informatique [cs.LO]

Haniel Barbosa. Efficient Instantiation Techniques in SMT (Work In Progress). PAAR 2016 - 5th Workshop on Practical Aspects of Automated Reasoning co-located with IJCAR 2016 - 8th International Joint Conference on Automated Reasoning, Jul 2016, Coimbra, Portugal. pp.1-10. ⟨hal-01388976⟩