6618 search results - page 291 / 1324 » Natural Logic for Natural Language |
193
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
174
click to vote
EUROCOLT
1999
Springer
15 years 11 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
190
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
197
click to vote
COOPIS
2003
IEEE
16 years 1 days ago
2003
IEEE
Abstract. Flora-2 is a rule-based object-oriented knowledge base system designed for a variety of automated tasks on the Semantic Web, ranging from meta-data management to informat...
155
click to vote
AAAI
2000
15 years 8 months ago
2000
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...