Sciweavers

JSC
2010
103views more  JSC 2010»
13 years 2 months ago
Anti-patterns for rule-based languages
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally ...
Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pie...
JSC
2010
102views more  JSC 2010»
13 years 2 months ago
Equational approximations for tree automata completion
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
Thomas Genet, Vlad Rusu
JSC
2010
62views more  JSC 2010»
13 years 2 months ago
The invariants of the binary nonic
We consider the algebra of invariants of binary forms of degree 9 with complex coefficients, find the 92 basic invariants, give an explicit system of parameters and show the exis...
Andries E. Brouwer, Mihaela Popoviciu
JSC
2010
99views more  JSC 2010»
13 years 2 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
Kurt Mehlhorn, Saurabh Ray
JSC
2010
85views more  JSC 2010»
13 years 2 months ago
On the minimum of a positive polynomial over the standard simplex
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of Rk , assuming that P is p...
Gabriela Jeronimo, Daniel Perrucci
JSC
2010
120views more  JSC 2010»
13 years 2 months ago
Theory decision by decomposition
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formu...
Maria Paola Bonacina, Mnacho Echenim
JSC
2010
107views more  JSC 2010»
13 years 2 months ago
Computing automorphisms of semigroups
J. Araújo, Paul von Bünau, J. D. Mitch...
JSC
2010
135views more  JSC 2010»
13 years 2 months ago
Deciding inseparability and conservative extensions in the description logic EL
We study the problem of deciding whether two ontologies are inseparable w.r.t. a signature Σ, i.e., whether they have the same consequences in the signature Σ. A special case is...
Carsten Lutz, Frank Wolter
JSC
2010
53views more  JSC 2010»
13 years 2 months ago
Combination of convex theories: Modularity, deduction completeness, and explanation
Duc-Khanh Tran, Christophe Ringeissen, Silvio Rani...