Sciweavers

793 search results - page 115 / 159
» Argumentation and standards of proof
Sort
View
SIAMJO
2008
110views more  SIAMJO 2008»
13 years 11 months ago
Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
We provide a rule to calculate the subdifferential of the pointwise supremum of an arbitrary family of convex functions defined on a real locally convex topological vector space. ...
Abderrahim Hantoute, Marco A. López, Consta...
COLING
2002
13 years 10 months ago
A Complete Integrated NLG System Using AI and NLU Tools
A standard architecture for an NLG system has been defined in (Reiter and Dale, 2000). Their work describes the modularization of an NLG system and the tasks of each module. Howev...
Laurence Danlos, Adil El Ghali
TPLP
2002
69views more  TPLP 2002»
13 years 10 months ago
Soundness, idempotence and commutativity of set-sharing
It is important that practical data-flow analyzers are backed by reliably proven theoretical Abstract interpretation provides a sound mathematical framework and necessary properti...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
CP
2010
Springer
13 years 9 months ago
Testing Expressibility Is Hard
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Ross Willard
LPAR
2010
Springer
13 years 9 months ago
How to Universally Close the Existential Rule
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...
Kai Brünnler