Results 11 to 20 of about 307,150 (181)

Heterogeneous Heuristic Optimisation and Scheduling for First-Order Theorem Proving

Lecture Notes in Computer Science, 2021
Good heuristics are essential for successful proof search in first-order automated theorem proving. As a result, state-of-the-art theorem provers offer a range of options for tuning the proof search process to specific problems. However, the vast configuration space makes it exceedingly challenging to construct effective heuristics.
Edvard K. Holden, Konstantin Korovin
openaire   +4 more sources

Optimization of Executable Formal Interpreters Developed in Higher-Order Logic Theorem Proving Systems

IEEE Access, 2018
In recent publications, we presented a novel formal symbolic process virtual machine (FSPVM) framework that combined higher-order logic theorem proving and symbolic execution for verifying the reliability and security of smart contracts developed in the ...
Zheng Yang, Hang Lei
doaj   +3 more sources

Rewrite method for theorem proving in first order theory with equality

Journal of Symbolic Computation, 1987
The purpose of this paper is the presentation of a complete rewrite rule method for predicate logic with equality, where unrestricted use of the equality predicate is allowed. A well known complete method for predicate logic, where equality may only appear in ``pure'' form (defining an equational theory), is narrowing combined with resolution [\textit ...
Jieh Hsiang
openaire   +3 more sources

Influences of Frege’s Predicate Logic on Some Computational Models [PDF]

Future Human Image, 2018
The purpose of this paper is to give some insights into the immense role of Frege’s first order logic (FOL) in the development of computer science. We argue that the FOL is fundamental in computer science, and that some computer science subfields could ...
Mohamad Awwad
doaj   +1 more source

Decreasing Diagrams for Confluence and Commutation [PDF]

Logical Methods in Computer Science, 2020
Like termination, confluence is a central property of rewrite systems. Unlike for termination, however, there exists no known complexity hierarchy for confluence.
Jörg Endrullis, Jan Willem Klop, Roy Overbeek   +2 more
doaj   +1 more source

Simulating reachability using first-order logic with applications to verification of linked data structures [PDF]

Logical Methods in Computer Science, 2009
This paper shows how to harness existing theorem provers for first-order logic to automatically verify safety properties of imperative programs that perform dynamic storage allocation and destructive updating of pointer-valued structure fields.
Tal Lev-Ami, Neil Immerman, Thomas Reps, Mooly Sagiv, Siddharth Srivastava, Greta Yorsh   +5 more
doaj   +1 more source

The convergence of power iteration method for tournament matrices and its applications [PDF]

ریاضی و جامعه, 2023
In this paper, we prove that for every tournament matrix with nonzero spectral radius, the power iteration method converges to a nonzero eigenvector corresponding to the eigenvalue with the maximum magnitude. An application of this result for ranking the
Amirhosein Nokhodkar, Rasool Kazemi
doaj   +1 more source

Simplification Method for Contradiction Separation Clause in First-order Logic AutomatedTheorem Prover CSE [PDF]

Jisuanji kexue
First-order logic automated theorem proving has the capacity to resolve a multitude of practical problems after formalization,and thus holds considerable practical value.As an advancement in automated theorem proving,contradiction separation deduction ...
WU Xin, CHEN Shuwei, JIANG Shipan
doaj   +1 more source

α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic [PDF]

International Journal of Computational Intelligence Systems, 2014
Based on the general form of α-resolution principle for a lattice-valued logic with truth-values defined in a lattice-valued logical algebra structure - lattice implication algebra, the further extended α-resolution method in this lattice ...
Xiaomei Zhong, Yang Xu, Jun Liu, Shuwei Chen   +3 more
doaj   +1 more source

Application of first-order logic to identify organizers and perpetrators of illegal actions in teams of a limited circle of people

Informatika, 2021
There are three main families of inference algorithms in first-order logic: direct inference and its application to deductive databases and production systems; backward inference procedures and logic programming systems; theorem proving systems based on ...
A. М. Sobol, E. I. Kozlova, Yu. A. Chernyavsky   +2 more
doaj   +1 more source