Sciweavers

1888 search results - page 135 / 378
» Proof theory and computational analysis
Sort
View
86
Voted
COLING
2002
15 years 13 days 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
98
Voted
MOC
1998
147views more  MOC 1998»
15 years 8 days ago
On the Diophantine equation |axn - byn | = 1
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptio...
Michael A. Bennett, Benjamin M. M. de Weger
RML
2002
82views Business» more  RML 2002»
15 years 8 days ago
A Nonmonotonic Rule System using Ontologies
The development of the Semantic Web proceeds in layers. Currently the most advanced layer that has reached maturity is the ontology layer, in the form of the DAML+OIL language whic...
Grigoris Antoniou
109
Voted
LICS
2010
IEEE
14 years 11 months ago
Equality Is Typable in Semi-full Pure Type Systems
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
Vincent Siles, Hugo Herbelin
CORR
2010
Springer
84views Education» more  CORR 2010»
14 years 10 months ago
Termination Casts: A Flexible Approach to Termination with General Recursion
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
Aaron Stump, Vilhelm Sjöberg, Stephanie Weiri...