Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,694,807 papers from all fields of science
Search
Sign In
Create Free Account
Journal of Symbolic Computation
Known as:
J. Symbolic Computation
The Journal of Symbolic Computation is a peer-reviewed monthly scientific journal covering all aspects of symbolic computation published by Academic…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Automated theorem proving
Computational geometry
Computer algebra system
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Polynomial Constraint Solving over Finite Domains with the Modified Bernstein Form
F. Bergenti
,
Stefania Monica
,
G. Rossi
Italian Conference on Computational Logic
2016
Corpus ID: 14861399
This paper describes an algorithm that can be used to effectively solve polynomial constraints over finite domains. Such…
Expand
2014
2014
Foreword: Technology integration into mathematics education and applications
J. L. Galán-García
,
G. Aguilera–Venegas
,
Pedro Rodríguez-Cielos
2014
Corpus ID: 124432669
2012
2012
Sequentiality in Real Number Computation
Amin Farjudian
,
A. Jung
,
A. Edalat
2012
Corpus ID: 116198226
1 Introduction 31.1 Classes of Numbers . . . . . . . . . . . . . . . . . . . . . . . . . 31.1.1 Countable Sets of Numbers: N, Z…
Expand
2010
2010
Journal of Symbolic Computation External and Internal Syntax of the Λ-calculus
M. Sato
,
R. Pollack
2010
Corpus ID: 17122050
It is well known that formally defining and reasoning about languages with binding (such as logics and λ-calculii) is problematic…
Expand
2008
2008
Program Verification by Reduction to Semi-algebraic Systems Solving
Bican Xia
,
Lu Yang
,
N. Zhan
Leveraging Applications of Formal Methods
2008
Corpus ID: 13646010
The discovery of invariants and ranking functions plays a central role in program verification. In our previous work, we…
Expand
Highly Cited
2005
Highly Cited
2005
Preserving the Confidentiality of Categorical Statistical Data Bases When Releasing Information for Association Rules*
S. Fienberg
,
A. Slavkovic
Data mining and knowledge discovery
2005
Corpus ID: 1360575
In the statistical literature, there has been considerable development of methods of data releases for multivariate categorical…
Expand
2002
2002
Runtime Service Composition via Logic-Based Program Synthesis
S. Lämmermann
2002
Corpus ID: 60385402
Dynamic composition of services from components at runtime can help to provide flexible service infrastructures, but requires…
Expand
1998
1998
Parallel Implementation of Schönhage's Integer GCD Algorithm
G. Cesari
International Workshop on Ant Colony Optimization…
1998
Corpus ID: 10097874
We present a parallel implementation of Schonhage's integer GCD algorithm on distributed memory architectures. Results are…
Expand
1996
1996
Tea: a System for Proving Termination of a Non-strict Higher-order Functional Language
Manfred Schmidt-Schau
1996
Corpus ID: 17726568
reduction: approximation: e; e! # e0 ej e0 C[e]; e nf-terminates C[e] j C[Te] context-skip: branching: f e1 : : : en; (f nf…
Expand
1993
1993
Hardware-Verification using First Order BDDs
K. Schneider
,
Ramayya Kumar
,
T. Kropf
Computer Hardware Description Languages and their…
1993
Corpus ID: 16769227
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE