Results 81 to 90 of about 1,423 (254)
Deductive Verification of the Sliding Window Protocol
Моделирование и анализ информационных систем, 2015 We consider the well-known Sliding Window Protocol which provides reliable and efficient transmission of data over unreliable channels. A formal proof of correctness for this protocol faces substantial difficulties caused by a high degree of parallelism ...
D. A. Chkliaev, V. A. Nepomniaschy
doaj +1 more source
Enhancing generalized spectral clustering with embedding Laplacian graph regularization
CAAI Transactions on Intelligence Technology, EarlyView.Abstract An enhanced generalised spectral clustering framework that addresses the limitations of existing methods by incorporating the Laplacian graph and group effect into a regularisation term is presented. By doing so, the framework significantly enhances discrimination power and proves highly effective in handling noisy data.
Hengmin Zhang +5 more
wiley +1 more source
Automated Reasoning in Higher-Order Logic using the TPTP THF Infrastructure
Journal of Formalized Reasoning, 2010 The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well known and well established infrastructure that supports research, development, and deployment of Automated Theorem Proving (ATP) systems.
Christoph Benzmueller, Geoff Sutcliffe
doaj
Mathematical Text Processing in EA-style: a Sequent Aspect
Journal of Formalized Reasoning, 2016 The paper is devoted to the study of one of the aspects of the so-called Evidence Algorithm programme advanced by Academician V.M.~Glushkov and connected with the problem of automated theorem-proving search in the signature of first-order theories that ...
Alexander Lyaletski
doaj +1 more source
DT-Solver: Automated Theorem Proving with Dynamic-Tree Sampling Guided by Proof-level Value Function [PDF]
, 2023 Haiming Wang +12 more
openalex +1 more source
Complexity and related enhancements for automated theorem-proving programs
Computers & Mathematics with Applications, 1976 AbstractIn this paper some enhancements for automated theorem-proving programs, techniques which can be combined with the various well known inference rules which are employed in such programs, are given. Proofs of some of the more difficult problems previously sought by use of automated theorem proving were obtained by a program utilizing these ...
L. Wos, J. McCharen, Ross A. Overbeek
openaire +2 more sources
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT The evaluation and assessment of network security is a decision‐making (DM) problem that occurs in an environment with multiple criteria, which have uncertainty, bipolarity, and extra‐related information. The traditional approaches fail to address the need to acquire a wide range of information for the assessment, especially in situations ...
Walid Emam +3 more
wiley +1 more source
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity [PDF]
, 1974 James R. Slagle
openalex +1 more source
Mesh‐Based Charge Simulation Method and Its Applications to Electrostatic Electric Field Computation
High Voltage, EarlyView.ABSTRACT The charge simulation method (CSM) is a well‐established numerical technique employed in electrostatic field calculations, primarily due to its simplicity and computational efficiency. However, conventional CSM face challenges when applied to complex geometries, as they necessitate meticulous manual placement of simulation charges and matching
Tahan Wang +5 more
wiley +1 more source
Just the facts, Jack: truths and myths of automated theorem provers [PDF]
, 1999 Roderick Moten
openalex +1 more source