Some Heuristics in Automatic Theorem Proving
Some heuristics in automatic theorem proving.
Some infinite products with interesting continued fraction expansions
We display several infinite products with interesting continued fraction expansions. Specifically, for various small values of necessarily excluding since that case cannot occur, we display infinite products in the field of formal power series whose truncations yield their every -th convergent.
Some issues in using formal methods for the development of reactive systems.
Some issues of fuzzy querying in relational databases
Fuzzy logic has been used for flexible database querying for more than 30 years. This paper examines some of the issues of flexible querying which seem to have potential for further research and development from theoretical and practical points of view. More precisely, defining appropriate fuzzy sets for queries, calculating matching degrees for commutative and non-commutative query conditions, preferences, merging constraints and wishes, empty and overabundant answers, and views on practical realizations...
Some key research problems in automated theorem proving for hardware and software verification.
This paper sketches the state of the art in the application of mechanical theorem provers to the verification of commercial computer hardware and software. While the paper focuses on the theorem proving system ACL2, developed by the two authors, it references much related work in formal methods. The paper is intended to satisfy the curiosity of readers interested in logic and artificial intelligence as to the role of mechanized theorem proving in hardware and software design today. In addition,...
Some methods of constructing kernels in statistical learning
This paper is a collection of numerous methods and results concerning a design of kernel functions. It gives a short overview of methods of building kernels in metric spaces, especially and . However we also present a new theory. Introducing kernels was motivated by searching for non-linear patterns by using linear functions in a feature space created using a non-linear feature map.
Some modifications of auxiliary pushdown automata
Some new technics regarding the parallelisation of ZéBuLoN, an object oriented finite element code for structural mechanics
A finite element code, called ZéBuLoN was parallelised some years ago. This code is entirely written using an object oriented framework (C++ is the support language). The aim of this paper is to present some problems which arose during the parallelization, and some innovative solutions. Especially, a new concept of message passing is presented which allows to take into account SMP machines while still using the parallel virtual machine abstraction.
Some new technics regarding the parallelisation of ZéBuLoN, an object oriented finite element code for structural mechanics
A finite element code, called ZéBuLoN was parallelised some years ago. This code is entirely written using an object oriented framework (C++ is the support language). The aim of this paper is to present some problems which arose during the parallelization, and some innovative solutions. Especially, a new concept of message passing is presented which allows to take into account SMP machines while still using the parallel virtual machine abstraction.
Some Notes on the Formal Definition of Streams
Some notes to the algebraization of Dempster-Shafer treatment of uncertainty
Some performance measures for vacation models with a batch Markovian arrival process.
Some problems in automata theory which depend on the models of set theory
We prove that some fairly basic questions on automata reading infinite words depend on the models of the axiomatic system ZFC. It is known that there are only three possibilities for the cardinality of the complement of an ω-language L(x1d49c;) accepted by a Büchi 1-counter automaton x1d49c;. We prove the following surprising result: there exists a 1-counter Büchi automaton x1d49c; such that the cardinality of the complement L(𝒜) − of the ω-language L(𝒜) is not determined...
Some problems in automata theory which depend on the models of set theory
We prove that some fairly basic questions on automata reading infinite words depend on the models of the axiomatic system ZFC. It is known that there are only three possibilities for the cardinality of the complement of an ω-language L(𝒜) accepted by a Büchi 1-counter automaton 𝒜. We prove the following surprising result: there exists a 1-counter Büchi automaton 𝒜 such that the cardinality of the complement L(𝒜) − of the ω-language L(𝒜) is not determined by ZFC: (1) There is a model V1...
Some problems in modelling of real systems by formalized ones
Some properties of cellular automata with equicontinuity points
Some properties of decomposition ordering, a simplification ordering to prove termination of rewriting systems
Some properties of min-wise independent families and groups of permutations.
Some Properties of p -Groups and Commutative p -Groups
This article describes some properties of p-groups and some properties of commutative p-groups.