Suchergebnisse - Symbolic and Algebraic Manipulation- Algebraic Algorithms General Terms
-
1
Higher-Order Pattern Anti-Unification in Linear Time
ISSN: 0168-7433, 1573-0670, 1573-0670Veröffentlicht: Dordrecht Springer Netherlands 01.02.2017Veröffentlicht in Journal of automated reasoning (01.02.2017)“… We present a rule-based Huet’s style anti-unification algorithm for simply typed lambda-terms, which computes a least general higher-order pattern generalization …”
Volltext
Journal Article -
2
Anti-unification for Unranked Terms and Hedges
ISSN: 0168-7433, 1573-0670Veröffentlicht: Dordrecht Springer Netherlands 01.02.2014Veröffentlicht in Journal of automated reasoning (01.02.2014)“… )terms with different top function symbols. First, we design a complete and minimal algorithm to compute least general generalizations …”
Volltext
Journal Article -
3
Evidence Algorithm and Inference Search in First-Order Logics
ISSN: 0168-7433, 1573-0670Veröffentlicht: Dordrecht Springer Netherlands 01.10.2015Veröffentlicht in Journal of automated reasoning (01.10.2015)“… In the early 1970s, in Kiev, research on automated theorem proving started in the framework of the so-called Evidence Algorithm (EA …”
Volltext
Journal Article -
4
Equivariant Unification
ISSN: 0168-7433, 1573-0670Veröffentlicht: Dordrecht Springer Netherlands 01.10.2010Veröffentlicht in Journal of automated reasoning (01.10.2010)“… It serves as the basis of logic programming, term rewriting, and automated theorem proving techniques that support reasoning about languages with name-binding …”
Volltext
Journal Article -
5
A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems
ISSN: 0938-1279, 1432-0622Veröffentlicht: Berlin/Heidelberg Springer-Verlag 01.12.2010Veröffentlicht in Applicable algebra in engineering, communication and computing (01.12.2010)“… Term rewrite systems are useful in many areas of computer science. Two especially important areas are decision procedures for the word problem of some algebraic systems and rule-based programming …”
Volltext
Journal Article -
6
Geometry-oblivious FMM for compressing dense SPD matrices
ISBN: 9781450351140, 145035114XISSN: 2167-4337Veröffentlicht: New York, NY, USA ACM 12.11.2017Veröffentlicht in International Conference for High Performance Computing, Networking, Storage and Analysis (Online) (12.11.2017)“… Compression requires N log N storage and work. In general, our scheme belongs to the family of hierarchical matrix approximation methods …”
Volltext
Tagungsbericht -
7
A combinatorial approach to involution and δ-regularity II: structure analysis of polynomial modules with pommaret bases
ISSN: 0938-1279, 1432-0622Veröffentlicht: Berlin/Heidelberg Springer-Verlag 01.07.2009Veröffentlicht in Applicable algebra in engineering, communication and computing (01.07.2009)“… Much of the existing literature on involutive bases concentrates on their efficient algorithmic construction. By contrast, we are here more concerned with …”
Volltext
Journal Article -
8
Symbolic implementation of the algorithm for calculating Adomian polynomials
ISSN: 0096-3003, 1873-5649Veröffentlicht: New York, NY Elsevier Inc 30.12.2003Veröffentlicht in Applied mathematics and computation (30.12.2003)“… trigonometric terms, and unique summation rules. It is well known that the algebraic manipulation language such as Mathematica is useful to facilitate such a hard computational work …”
Volltext
Journal Article -
9
Analysis of the multistrain asymmetric SI model for arbitrary strain diversity
ISSN: 0895-7177, 1872-9479Veröffentlicht: Kidlington Elsevier Ltd 01.03.2011Veröffentlicht in Mathematical and computer modelling (01.03.2011)“… Since Mathematica is an algebraic manipulator, analytical expressions are presented for the equilibrium population variables in terms of the forces of infection for arbitrary number of strains, n …”
Volltext
Journal Article -
10
Context-sensitive analysis without calling-context
ISSN: 1388-3690, 1573-0557Veröffentlicht: Boston Springer US 01.09.2010Veröffentlicht in Higher-Order and Symbolic Computation (01.09.2010)“… Since Sharir and Pnueli, algorithms for context-sensitivity have been defined in terms of ‘valid …”
Volltext
Journal Article -
11
An empirical study of cache-oblivious polygon indecomposability testing
ISSN: 0010-485X, 1436-5057Veröffentlicht: Vienna Springer Vienna 01.06.2010Veröffentlicht in Computing (01.06.2010)“… We implement and undertake an empirical study of the cache-oblivious variant of the polygon indecomposability testing algorithm of Gao and Lauder, based on a depth-first search (DFS …”
Volltext
Journal Article -
12
Type-specialized staged programming with process separation
ISSN: 1388-3690, 1573-0557Veröffentlicht: Boston Springer US 01.11.2011Veröffentlicht in Higher-Order and Symbolic Computation (01.11.2011)“… Staging is a powerful language construct that allows a program at one stage of evaluation to manipulate and specialize a program to be executed at a later …”
Volltext
Journal Article -
13
A lean specification for GADTs: system F with first-class equality proofs
ISSN: 1388-3690, 1573-0557Veröffentlicht: Boston Springer US 01.06.2010Veröffentlicht in Higher-Order and Symbolic Computation (01.06.2010)“… Generalized Algebraic Data Types are a generalization of Algebraic Data Types with additional type equality constraints …”
Volltext
Journal Article -
14
MatchingTools: A Python library for symbolic effective field theory calculations
ISSN: 0010-4655, 1879-2944Veröffentlicht: Elsevier B.V 01.06.2018Veröffentlicht in Computer physics communications (01.06.2018)“… MatchingTools is a Python library for doing symbolic calculations in effective field theory …”
Volltext
Journal Article -
15
Direct transformation from Cartesian into geodetic coordinates on a triaxial ellipsoid
ISSN: 0098-3004, 1873-7803Veröffentlicht: Elsevier Ltd 01.09.2020Veröffentlicht in Computers & geosciences (01.09.2020)“… This paper1 presents two new direct symbolic-numerical algorithms for the transformation of Cartesian coordinates into geodetic coordinates considering the general case of a triaxial reference ellipsoid …”
Volltext
Journal Article -
16
Linear recurrences with carry as uniform random number generators
ISBN: 0780330188, 9780780330184Veröffentlicht: Washington, DC, USA IEEE Computer Society 01.12.1995Veröffentlicht in Proceedings of the 27th conference on Winter simulation (01.12.1995)“… Marsaglia and A. Zaman (1991). We define for them a general (infinite) state space and focus our attention on the (finite …”
Volltext
Tagungsbericht -
17
Synthesis from Examples: Interaction Models and Algorithms
ISBN: 9781467350266, 1467350265Veröffentlicht: IEEE 01.09.2012Veröffentlicht in 2012 4th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC (01.09.2012)“… ) design of an efficient search algorithm - these algorithms have been based on paradigms from various communities including use of SAT/SMT solvers …”
Volltext
Tagungsbericht -
18
The MAPLE package TDDS for computing Thomas decompositions of systems of nonlinear PDEs
ISSN: 0010-4655, 1879-2944Veröffentlicht: Elsevier B.V 01.01.2019Veröffentlicht in Computer physics communications (01.01.2019)“… We present the Maple package TDDS (Thomas Decomposition of Differential Systems). Given a polynomially nonlinear differential system, which in addition to …”
Volltext
Journal Article -
19
Direct transformation from Cartesian into geodetic coordinates on a triaxial ellipsoid
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 13.09.2019Veröffentlicht in arXiv.org (13.09.2019)“… This paper presents two new direct symbolic-numerical algorithms for the transformation of Cartesian coordinates into geodetic coordinates considering the general case of a triaxial reference ellipsoid …”
Volltext
Paper -
20
LARGE DEFORMATION ANALYSIS OF A CYLINDRICAL SHELL UNDER PURE BENDING AND PRESSURIZATION
ISBN: 9798641072043Veröffentlicht: ProQuest Dissertations & Theses 01.01.1983“… The MACSYMA symbolic manipulation system is first applied alone and then in combination with two different gradient method-type optimization algorithms on the analysis of a large deformation shell problem …”
Volltext
Dissertation

