Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Automated theorem provingComputational geometryComputer algebra systemComputer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Recovering and Utilizing Partial Duality in QBF
Quantified Boolean Formula (QBF) solvers that utilize non-CNF representations are able to reason dually about conflicts and… 
2012
2012
Optimal controlled variables for polynomial systems
2009
2009
Artifact-Centric Workflow Dominance
In this paper we initiate a study on comparing artifact-centric workflow schemas, in terms of the ability of one schema to… 
Review
2008
Review
2008
A Survey of Statistical Approaches to Preserving Confidentiality of Contingency Table Entries
In the statistical literature, there has been considerable development of methods of data releases for multivariate categorical… 
2006
2006
SATU : A SYSTEM FOR DISTRIBUTED PROPOSITIONAL SATISFIABILITY CHECKING IN COMPUTATIONAL GRIDS
In addition to data storage and indexing systems, computational grids are used for solving computationally demanding tasks… 
Highly Cited
2005
Highly Cited
2005
Preserving the Confidentiality of Categorical Statistical Data Bases When Releasing Information for Association Rules*
In the statistical literature, there has been considerable development of methods of data releases for multivariate categorical… 
2004
2004
PROOF COMPLEXITY OF CUT – BASED TABLEAUX FOR BOOLEAN CIRCUIT SATISFIABILITY CHECKING
This report deals with propositional satisfiability checking. Most successful satisfiability checkers are based on the Davis… 
Highly Cited
2002
Highly Cited
2002
Runtime Service Composition via Logic-Based Program Synthesis
Dynamic composition of services from components at runtime can help to provide flexible service infrastructures, but requires… 
2001
2001
A Theory of Observables for Logic Programs
We define a semantic framework to reason about properties of abstractions of SLD-derivations. The framework allows us to address… 
1996
1996
Turchin's Supercompiler Revisited - An operational theory of positive information propagation
Turchin`s supercompiler is a program transformer that includes both partial evaluation and deforestation. Although known in the… 
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)