246 search results - page 19 / 50 » The Truth About Defaults |
IFL
2005
Springer
14 years 3 months ago
2005
Springer
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
ATAL
2006
Springer
14 years 1 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
IJCAI
1997
13 years 11 months ago
1997
Explicit preferences on assumptions as used in prioritized circumscription [McCarthy, 1986; Lifschitz, 1985; Grosof, 1991] and preferred subtheories [Brewka, 1989] provide a clear...
EACL
1989
ACL Anthology
13 years 11 months ago
1989
ACL Anthology
DATR is a declarative language for representing a restricted class of inheritance networks, permitting both multiple and default inheritance. The principal intended area of applic...
COLING
2002
13 years 9 months ago
2002
Meaning shifting phenomena such as metonymy have recently attracted increasing interest of researchers. Though these phenomena have been addressed by plenty of computational metho...