Sciweavers

148 search results - page 12 / 30
» On the extender algebra being complete
Sort
View
CASC
2009
Springer
180views Mathematics» more  CASC 2009»
13 years 8 months ago
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
Aless Lasaruk, Thomas Sturm
CSL
2010
Springer
13 years 8 months ago
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
Barnaby Martin, Jos Martin
AISC
2010
Springer
13 years 11 months ago
How to Correctly Prune Tropical Trees
We present tropical games, a generalization of combinatorial min-max games based on tropical algebras. Our model breaks the traditional symmetry of rational zero-sum games where pl...
Jean-Vincent Loddo, Luca Saiu
JUCS
2000
76views more  JUCS 2000»
13 years 7 months ago
Mixed Relations as Enriched Semiringal Categories
Abstract: A study of the classes of nite relations as enriched strict monoidal categories is presented in CaS91]. The relations there are interpreted as connections in owchart sche...
Radu Grosu, Dorel Lucanu, Gheorghe Stefanescu
ICSE
2003
IEEE-ACM
14 years 23 days ago
A Tutorial on Feature Oriented Programming and Product-Lines
ct Feature Oriented Programming (FOP) is a design methodology and tools for program synthesis. The goal is to specify a target program in terms of the features that it offers, and ...
Don S. Batory