Sciweavers

1963 search results - page 45 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
123
Voted
ICTAI
2006
IEEE
15 years 8 months ago
Computing Horn Strong Backdoor Sets Thanks to Local Search
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
Lionel Paris, Richard Ostrowski, Pierre Siegel, La...
101
Voted
UAI
2001
15 years 4 months ago
Similarity Measures on Preference Structures, Part II: Utility Functions
In previous work [8] we presented a casebased approach to eliciting and reasoning with preferences. A key issue in this approach is the definition of similarity between user prefe...
Vu A. Ha, Peter Haddawy, John Miyamoto
209
Voted
ICLP
2009
Springer
16 years 3 months ago
Incremental Answer Completion in the SLG-WAM
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
Alexandre Miguel Pinto, Luís Moniz Pereira,...
95
Voted
HRI
2007
ACM
15 years 6 months ago
Elements of a spoken language programming interface for robots
In many settings, such as home care or mobile environments, demands on users' attention, or users' anticipated level of formal training, or other on-site conditions will...
Tim Miller, Andrew Exley, William Schuler
98
Voted
LREC
2008
87views Education» more  LREC 2008»
15 years 4 months ago
Translation Adequacy and Preference Evaluation Tool (TAP-ET)
Evaluation of Machine Translation (MT) technology is often tied to the requirement for tedious manual judgments of translation quality. While automated MT metrology continues to b...
Mark A. Przybocki, Kay Peterson, Sebastien Bronsar...