Sciweavers

19 search results - page 1 / 4
» Scope Dominance with Generalized Quantifiers
Sort
View
BIRTHDAY
2009
Springer
13 years 9 months ago
Scope Dominance with Generalized Quantifiers
Gilad Ben-Avi, Yoad Winter
AGI
2008
13 years 6 months ago
Probabilistic Quantifier Logic for General Intelligence: An Indefinite Probabilities Approach
: Indefinite probabilities are a novel technique for quantifying uncertainty, which were created as part of the PLN (Probabilistic Logic Networks) logical inference engine, which i...
Matthew Iklé, Ben Goertzel
ACL
1989
13 years 6 months ago
A General Computational Treatment of the Comparative
We present a general treatment of the comparative that is based on more basic linguistic elements so that the underlying system can be effectively utilized: in the syntactic analy...
Carol Friedman
ICLP
1990
Springer
13 years 9 months ago
Extending Definite Clause Grammars with Scoping Constructs
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
Remo Pareschi, Dale Miller
ICFP
2005
ACM
14 years 4 months ago
The anatomy of a loop: a story of scope and control
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
Olin Shivers