Search
Search Results
-
Towards Formal Verification of Neural Networks in Cyber-Physical Systems
Machine Learning approaches have been successfully used for the creation of high-performance control components of cyber-physical systems, where the...
-
Heterogeneous Heuristic Optimisation and Scheduling for First-Order Theorem Proving
Good heuristics are essential for successful proof search in first-order automated theorem proving. As a result, state-of-the-art theorem provers...
-
Certifying DFA Bounds for Recognition and Separation
The automation of decision procedures makes certification essential. We suggest to use determinacy of turn-based two-player games with regular...
-
Human-Centered Automated Proof Search
Human-centered automated proof search aims to capture structures of ordinary mathematical proofs and discover human strategies that are used...
-
Enforcing ethical goals over reinforcement-learning policies
Recent years have yielded many discussions on how to endow autonomous agents with the ability to make ethical decisions, and the need for explicit...
-
Proof of location based delivery system using multi-party virtual state channel: a blockchain model
Supply chain management speeds up the delivery system and product flow towards customers. It is required to update the delivery system and fulfill...
-
Efficient Transparent Polynomial Commitments for zk-SNARKs
This paper proposes a new efficient transparent polynomial commitment scheme. In a polynomial commitment scheme, a prover commits a polynomial and a...
-
Trocq: Proof Transfer for Free, With or Without Univalence
This article presents Trocq, a new proof transfer framework for dependent type theory. Trocq is based on a novel formulation of type equivalence,...
-
On Verified Automated Reasoning in Propositional Logic
As the complexity of software systems is ever increasing, so is the need for practical tools for formal verification. Among these are automatic...
-
Induction in Saturation
Proof by induction is commonplace in modern mathematics and computational logic. This paper overviews and discusses our recent results in turning...
-
Vampire Getting Noisy: Will Random Bits Help Conquer Chaos? (System Description)
Treating a saturation-based automatic theorem prover (ATP) as a Las Vegas randomized algorithm is a way to illuminate the chaotic nature of proof...
-
A Wos Challenge Met
In his regular column in the AAR Newsletter, Larry Wos typically posed challenges to the automated reasoning community. Some of these challenges...
-
AutoPKI: public key infrastructure for IoT with automated trust transfer
IoT deployments grow in numbers and size, which makes questions of long-term support and maintainability increasingly important. Without scalable and...
-
Prolog Technology Reinforcement Learning Prover
We present a reinforcement learning toolkit for experiments with guiding automated theorem proving in the connection calculus. The core of the...
-
Characterizing Deterministic-Prover Zero Knowledge
Randomness is typically thought to be essential for zero knowledge protocols. Following this intuition, Goldreich and Oren (Journal of Cryptology 94)...
-
Clause and Literal Selection Strategies Based on Complementary Pair Distribution for Contradiction Separation Deduction
The automated deduction mechanism based on contradiction separation is a novel deduction mechanism, which has some outstanding features, such as...
-
Multi-theorem Designated-Verifier NIZK for QMA
We present a designated-verifier non-interactive zero-knowledge argument system for QMA with multi-theorem security under the Learning with Errors...
-
Learning Theorem Proving Components
Saturation-style automated theorem provers (ATPs) based on the given clause procedure are today the strongest general reasoners for classical...
-
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance
Succinct arguments allow a powerful (yet polynomial-time) prover to convince a weak verifier of the validity of some NP statement using very little...
-
A Framework for Verifying the Collision Freeness of Collaborative Robots (Work in Progress)
Collision avoidance is a major problem when robotic devices are being deployed to perform complex collaborative tasks. We present a vision for a...