Sciweavers

4066 search results - page 212 / 814
» Almost Complete Sets
Sort
View
JSYML
2008
86views more  JSYML 2008»
15 years 6 months ago
On Skolemization in constructive theories
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...
Matthias Baaz, Rosalie Iemhoff
ENTCS
2007
101views more  ENTCS 2007»
15 years 6 months ago
Inequational Deduction as Term Graph Rewriting
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a s...
Andrea Corradini, Fabio Gadducci, Wolfram Kahl, Ba...
JCT
2007
103views more  JCT 2007»
15 years 6 months ago
Geometric drawings of Kn with few crossings
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
Bernardo M. Ábrego, Silvia Fernández...
CCE
2004
15 years 6 months ago
Nonequilibrium modeling of three-phase distillation
A nonequilibrium (NEQ) model for a complete three-phase distillation in tray columns is described. The model consists of a set of mass and energy balances for each of the three po...
A. Higler, R. Chande, R. Taylor, R. Baur, R. Krish...
CI
2004
75views more  CI 2004»
15 years 6 months ago
Utility Functions for Ceteris Paribus Preferences
Although ceteris paribus preference statements concisely represent one natural class of preferences over outcomes or goals, many applications of such preferences require numeric u...
Michael McGeachie, Jon Doyle