Martin Suda
YOU?
Author Swipe
View article: On neutron holography, neutron interferometry, and neutron orbital angular momentum
On neutron holography, neutron interferometry, and neutron orbital angular momentum Open
In Opt . Express 24 , 22528 ( 2016 ) 10.1364/OE.24.022528 , D. Sarenac et al. reported neutron holography using a Laue crystal interferometer and a spiral phase plate, interpreting the resulting interference pattern as a hologram reconstru…
View article: On neutron holography, neutron interferometry and neutron orbital angular momentum
On neutron holography, neutron interferometry and neutron orbital angular momentum Open
A neutron Laue crystal interferometer has been reported by Saranac et al . to demonstrate neutron holography of a spiral phase plate. Using its two coherent beams as the object and reference beams, the resulting interference pattern was in…
View article: Efficient Neural Clause-Selection Reinforcement
Efficient Neural Clause-Selection Reinforcement Open
Clause selection is arguably the most important choice point in saturation-based theorem proving. Framing it as a reinforcement learning (RL) task is a way to challenge the human-designed heuristics of state-of-the-art provers and to inste…
View article: Efficient Neural Clause-Selection Reinforcement
Efficient Neural Clause-Selection Reinforcement Open
Clause selection is arguably the most important choice point in saturation-based theorem proving. Framing it as a reinforcement learning (RL) task is a way to challenge the human-designed heuristics of state-of-the-art provers and to inste…
View article: Planning Domain Model Acquisition from State Traces without Action Parameters
Planning Domain Model Acquisition from State Traces without Action Parameters Open
Existing planning action domain model acquisition approaches consider different types of state traces from which they learn. The differences in state traces refer to the level of observability of state changes (from full to none) and wheth…
View article: A Higher-Order Vampire (Short Paper)
A Higher-Order Vampire (Short Paper) Open
The support for higher-order reasoning in the Vampire theorem prover has recently been completely reworked. This rework consists of new theoretical ideas, a new implementation, and a dedicated strategy schedule. The theoretical ideas are s…
View article: Learning Guided Automated Reasoning: A Brief Survey
Learning Guided Automated Reasoning: A Brief Survey Open
Automated theorem provers and formal proof assistants are general reasoning systems that are in theory capable of proving arbitrarily hard theorems, thus solving arbitrary problems reducible to mathematics and logical reasoning. In practic…
View article: Planning Domain Model Acquisition from State Traces without Action Parameters
Planning Domain Model Acquisition from State Traces without Action Parameters Open
Existing planning action domain model acquisition approaches consider different types of state traces from which they learn. The differences in state traces refer to the level of observability of state changes (from full to none) and wheth…
View article: A Higher-Order Vampire (Short Paper)
A Higher-Order Vampire (Short Paper) Open
The support for higher-order reasoning in the Vampire theorem prover has recently been completely reworked. This rework consists of new theoretical ideas, a new implementation, and a dedicated strategy schedule. The theoretical ideas are s…
View article: On the neutron orbital angular momentum: Has it actually been demonstrated?
On the neutron orbital angular momentum: Has it actually been demonstrated? Open
In a Nature LETTER [1], a control of neutron angular momentum was apparently demonstrated using a neutron crystal interferometer. In the meantime, a number of highly interesting articles have been published dealing with the n-OAM and neutr…
View article: Review of: "A direct calculation in the newtonian gravity framework"
Review of: "A direct calculation in the newtonian gravity framework" Open
Potential competing interests: No potential competing interests to
View article: How Much Should This Symbol Weigh? A GNN-Advised Clause Selection
How Much Should This Symbol Weigh? A GNN-Advised Clause Selection Open
Clause selection plays a crucial role in modern saturation-based automatic theorem provers. A commonly used heuristic suggests prioritizing small clauses, i.e., clauses with few symbol occurrences. More generally, we can give preference to…
View article: MizAR 60 for Mizar 50
MizAR 60 for Mizar 50 Open
As a present to Mizar on its 50th anniversary, we develop an AI/TP system that automatically proves about 60\% of the Mizar theorems in the hammer setting. We also automatically prove 75\% of the Mizar theorems when the automated provers a…
View article: Spectra of neutron wave functions in Earth’s gravitational field
Spectra of neutron wave functions in Earth’s gravitational field Open
The time evolution of a quantum wave packet in the linear gravity potential is known as Quantum Bouncing Ball. The qBounce collaboration recently observed such a system by dropping wave packets of ultracold neutrons by a height of roughly …
View article: Vampire Getting Noisy: Will Random Bits Help Conquer Chaos? (System Description)
Vampire Getting Noisy: Will Random Bits Help Conquer Chaos? (System Description) Open
Treating a saturation-based automatic theorem prover (ATP) as a Las Vegas randomized algorithm is a way to illuminate the chaotic nature of proof search and make it amenable to study by probabilistic tools. On a series of experiments with …
View article: SAT Competition 2020
SAT Competition 2020 Open
The SAT Competitions constitute a well-established series of yearly open international algorithm implementation competitions, focusing on the Boolean satisfiability (or propositional satisfiability, SAT) problem. In this article, we provid…
View article: New Techniques that Improve ENIGMA-style Clause Selection Guidance.
New Techniques that Improve ENIGMA-style Clause Selection Guidance. Open
We re-examine the topic of machine-learned clause selection guidance in saturation-based theorem provers. The central idea, recently popularized by the ENIGMA system, is to learn a classifier for recognizing clauses that appeared in previo…
View article: Improving ENIGMA-Style Clause Selection While Learning From History
Improving ENIGMA-Style Clause Selection While Learning From History Open
We re-examine the topic of machine-learned clause selection guidance in saturation-based theorem provers. The central idea, recently popularized by the ENIGMA system, is to learn a classifier for recognizing clauses that appeared in previo…
View article: Vampire With a Brain Is a Good ITP Hammer
Vampire With a Brain Is a Good ITP Hammer Open
Vampire has been for a long time the strongest first-order automatic theorem prover, widely used for hammer-style proof automation in ITPs such as Mizar, Isabelle, HOL, and Coq. In this work, we considerably improve the performance of Vamp…
View article: Neural Precedence Recommender
Neural Precedence Recommender Open
The state-of-the-art superposition-based theorem provers for first-order logic rely on simplification orderings on terms to constrain the applicability of inference rules, which in turn shapes the ensuing search space. The popular Knuth-Be…
View article: Improving ENIGMA-style Clause Selection while Learning From History
Improving ENIGMA-style Clause Selection while Learning From History Open
We re-examine the topic of machine-learned clause selection guidance in saturation-based theorem provers. The central idea, recently popularized by the ENIGMA system, is to learn a classifier for recognizing clauses that appeared in previo…
View article: Learning Precedences from Simple Symbol Features
Learning Precedences from Simple Symbol Features Open
A simplification ordering, typically specified by a symbol precedence, is one of the key parameters of the superposition calculus, contributing to shaping the search space navigated by a saturation-based automated theorem prover. Thus the …
View article: Layered Clause Selection for Saturation-based Theorem Proving
Layered Clause Selection for Saturation-based Theorem Proving Open
Clause selection is one of the main heuristic decision points in navigating proof search of saturation-based theorem provers. A recently developed layered clause selection framework allows one to boost a basic clause selection heuristic by…
View article: Aiming for the Goal with SInE
Aiming for the Goal with SInE Open
The Sumo INference Engine (SInE) is a well-established premise selection algorithm for first-order theorem provers, routinely used, especially on large theory problems. The main idea of SInE is to start from the goal formula and to iterati…
View article: Layered Clause Selection for Theory Reasoning
Layered Clause Selection for Theory Reasoning Open
Explicit theory axioms are added by a saturation-based theorem prover as one of the techniques for supporting theory reasoning. While simple and effective, adding theory axioms can also pollute the search space with many irrelevant consequ…