306 search results - page 6 / 62 » Underspecified computation of normal forms |
CI
2007
14 years 11 months ago
2007
: When one tries to use the Web as a dictionary or encyclopedia, entering some single term into a search engine, the highly-ranked pages in the result can include irrelevant or use...
AAAI
2000
15 years 28 days ago
2000
We analyze a corpus of referring expressions collected from user interactions with a multimodal travel guide application. The analysis suggests that, in dramatic contrast to norma...
MFCS
1997
Springer
15 years 3 months ago
1997
Springer
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
COLING
2010
14 years 6 months ago
2010
We propose and implement a modification of the Eisner (1996) normal form to account for generalized composition of bounded degree, and an extension to deal with grammatical type-r...
115
click to vote
ASP
2005
Springer
15 years 5 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...