Results 121 to 130 of about 1,423 (254)
An Experimental Study of Formula Embeddings for Automated Theorem Proving in First-Order Logic
, 2020 Ibrahim Abdelaziz +3 more
openalex +2 more sources
Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search
Advanced Quantum Technologies, Volume 8, Issue 10, October 2025.This article proposes the Progressive Widening enhanced Monte Carlo Tree Search (PWMCTS) to design parameterized quantum circuits. It improves the efficiency of the previous MCTS‐based techniques in terms of number of quantum circuit evaluation, number of gates and CNOT count.
Vincenzo Lipardi +3 more
wiley +1 more source
Special Issue of Selected Extended Papers of IJCAR 2020. [PDF]
J Autom Reason, 2022 Peltier N, Sofronie-Stokkermans V.
europepmc +1 more source
Bayesian Optimisation for Heuristic Configuration in Automated Theorem Proving
, 2020 Agnieszka Słowik +4 more
openalex +2 more sources
Distributed Self‐Triggered Formation Control for Multiple Mobile Robots With Dynamic Mappings
International Journal of Robust and Nonlinear Control, Volume 35, Issue 15, Page 6444-6462, October 2025.ABSTRACT This article proposes a distributed self‐triggered formation control scheme for a group of mobile robots to achieve a desired formation. The robots are assumed to have convex polygon geometric properties. Switching modes are introduced into the distributed formation controller design to balance formation moving and inter‐robot collision ...
Yutong Liu +4 more
wiley +1 more source
A Path Planning Algorithm Based on Tangent Point Search and Constrained B‐Spline
Journal of Field Robotics, Volume 42, Issue 7, Page 3121-3137, October 2025.ABSTRACT The traditional Tangent Point Search (TPS) algorithm, as a path planning algorithm suitable for large‐scale maps, performs well in the presence of large rectangular obstacles. However, it has two disadvantages: 1. it requires that the obstacles be rectangular so that the shape of obstacles is limited to the fixed form. 2.
Ge Tai +6 more
wiley +1 more source
Automated ZFC Theorem Proving with E
, 2019 I introduce an approach for automated reasoning in first order set theories that are not finitely axiomatizable, such as $ZFC$, and describe its implementation alongside the automated theorem proving software E. I then compare the results of proof search in the class based set theory $NBG$ with those of $ZFC$.
openaire +2 more sources
A Validation Methodology for XAI Decision Support Systems Against Relational Domain Properties
Journal of Software: Evolution and Process, Volume 37, Issue 10, October 2025.ABSTRACT The global adoption of artificial intelligence (AI) has increased dramatically in recent years, becoming commonplace in many fields. Such a pervasiveness has led to changes in how AI is perceived, strengthening discussions on its societal consequences. Thus, a new class of requirements for AI‐based solutions emerged. Broadly speaking, those on
Emanuele De Angelis +3 more
wiley +1 more source