We present an environment for proving correctness of mutually recursive functional programs. As usual, correctness is transformed into a set of first-order predicate logic formulae - verification conditions. As a dist...
详细信息
We present an environment for proving correctness of mutually recursive functional programs. As usual, correctness is transformed into a set of first-order predicate logic formulae - verification conditions. As a distinctive feature of our method, these formulae are not only sufficient, but also necessary for the correctness.
the symbolic-numeric program SELFA for solving the the 2D boundary-value problem in self-consistent basis method is presented. the corresponding algorithm of this program using a conventional pseudocode is described t...
详细信息
the purpose of the research presented in this paper is to extend the author's results on sequent forms of Herbrand theorems for classical and intuitionistic logics onto classical and intuitionistic modal sequent l...
详细信息
the purpose of the research presented in this paper is to extend the author's results on sequent forms of Herbrand theorems for classical and intuitionistic logics onto classical and intuitionistic modal sequent logics. It was found that the technique reported at the SYNASC 2008symposium and based on the original notions of admissibility and compatibility can satisfactorily be applied for proving Herbrand theorems for the logics under consideration in the sequent form.
Denote by P n the space of real polynomials p of degree at most n equipped withthe sup norm on the interval I = [−1, 1]. the unit ball B n with respect to the sup norm is a compact convex set. Let EB n denote the ...
详细信息
Denote by P n the space of real polynomials p of degree at most n equipped withthe sup norm on the interval I = [−1, 1]. the unit ball B n with respect to the sup norm is a compact convex set. Let EB n denote the set of the extreme points of B n .
In this paper we extend some decidability results concerning the coverability problem and a related one, the quasi-liveness problem, from jumping Petri nets with finite jumps to the larger class of reduced-computable ...
详细信息
In this paper we extend some decidability results concerning the coverability problem and a related one, the quasi-liveness problem, from jumping Petri nets with finite jumps to the larger class of reduced-computable jumping Petri ***, as future work, we discuss some ideas for parallel implementations of the decision procedures for these problems.
We report on a symbolic-numeric algorithm for computingthe Alexander polynomial of each singularity of a plane complex algebraic curve defined by a polynomial with coefficients of limited accuracy, i.e. the coefficie...
详细信息
We report on a symbolic-numeric algorithm for computingthe Alexander polynomial of each singularity of a plane complex algebraic curve defined by a polynomial with coefficients of limited accuracy, i.e. the coefficients are both exact and inexact data. We base the algorithm on combinatorial methods from knot theory which we combine with computational geometry algorithms in order to compute efficient and accurate results. Nonetheless the problem we are dealing with is ill-posed, in the sense that tiny perturbations in the coefficients of the defining polynomial cause huge errors in the computed results.
the densest k-subgraph problem is a relaxation of the well-known maximum clique problem and consists of finding a subgraph with exactly k nodes and a maximum number of edges. An ant colony optimisation-based approach ...
详细信息
the densest k-subgraph problem is a relaxation of the well-known maximum clique problem and consists of finding a subgraph with exactly k nodes and a maximum number of edges. An ant colony optimisation-based approach is proposed to solve this combinatorial optimisation problem. numerical experiments show the effectiveness and potential of the proposed approach.
the principal benefit introduced by distributed systems is the ability to use the computation power and processing capabilities of multiple processing nodes in order to solve problems infeasible on a single machine. F...
详细信息
the principal benefit introduced by distributed systems is the ability to use the computation power and processing capabilities of multiple processing nodes in order to solve problems infeasible on a single machine. For symboliccomputingthese advantages are particularly useful. In order to create a successful distributed system to support symbolic computations is important to have a deep understanding of the way the computer algebra specialists interact with a symboliccomputing system. In this paper we investigate general processing capabilities of symboliccomputing systems related to control flow and we emphasize several execution patterns. the impact that workflow management functionalities have over general execution patterns in symboliccomputing are also investigated.
the paper proposes to the information security specialists, a new algorithm based on a synchronous stream cipher HENKOS, built around a performing pseudorandom number generator. the paper describes the main parts of t...
详细信息
the paper proposes to the information security specialists, a new algorithm based on a synchronous stream cipher HENKOS, built around a performing pseudorandom number generator. the paper describes the main parts of the algorithm, analyze the quality of the implementation, measure the performance and present the statistical tests results for the pseudorandom number generator .
Quantified Boolean Formulas (QBFs) extend propositional formulas by quantifiers over the Boolean variables. this extension makes the QBF decision problem PSPACE-hard. therefore, QBFs provide an attractive reasoning fr...
详细信息
Quantified Boolean Formulas (QBFs) extend propositional formulas by quantifiers over the Boolean variables. this extension makes the QBF decision problem PSPACE-hard. therefore, QBFs provide an attractive reasoning framework for many reasoning problems from artificial intelligence, formal verification, and other fields. In this work, we review current advancements in the theory and practice of QBF solving.
暂无评论