Sciweavers

884 search results - page 123 / 177
» A Proof Theory for DL-Lite
Sort
View
AML
2000
71views more  AML 2000»
14 years 11 months ago
Consistency of V = HOD with the wholeness axiom
The Wholeness Axiom (WA) is an axiom schema that can be added to the axioms of ZFC in an extended language {, j}, and that asserts the existence of a nontrivial elementary embeddin...
Paul Corazza
COLING
2002
14 years 11 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
ENTCS
2002
90views more  ENTCS 2002»
14 years 11 months ago
Simple Easy Terms
We illustrate the use of intersection types as a semantic tool for proving easiness result on -terms. We single out the notion of simple easiness for -terms as a useful semantic p...
Fabio Alessi, Stefania Lusin
FOCM
2002
83views more  FOCM 2002»
14 years 11 months ago
A Rigorous ODE Solver and Smale's 14th Problem
We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of i...
Warwick Tucker
DCG
1999
93views more  DCG 1999»
14 years 11 months ago
New Maximal Numbers of Equilibria in Bimatrix Games
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
Bernhard von Stengel