Sciweavers

1969 search results - page 161 / 394
» Financial Theory 1
Sort
View
SIGLEX
1991
15 years 10 months ago
Logical Structures in the Lexicon
The lexical entry for a word must contain all the information needed to construct a semantic representation for sentences that contain the word. Because of that requirement, the f...
John F. Sowa
EXPERT
2006
156views more  EXPERT 2006»
15 years 6 months ago
Computational Models of Ethical Reasoning: Challenges, Initial Steps, and Future Directions
on abstract principles that you can't easily apply in a formal, deductive fashion. So, the favorite tools of logicians and mathematicians, such as firstorder logic, aren'...
Bruce M. McLaren
APAL
2005
119views more  APAL 2005»
15 years 6 months ago
Elementary arithmetic
Abstract. There is a very simple way in which the safe/normal variable discipline of Bellantoni-Cook recursion (1992) can be imposed on arithmetical theories like PA: quantify over...
Geoffrey E. Ostrin, Stanley S. Wainer
CORR
2002
Springer
95views Education» more  CORR 2002»
15 years 6 months ago
Unsupervised Learning of Morphology without Morphemes
The first morphological learner based upon the theory of Whole Word Morphology (Ford et al., 1997) is outlined, and preliminary evaluation results are presented. The program, Whol...
Sylvain Neuvel, Sean A. Fulop
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 6 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch