Sciweavers

982 search results - page 158 / 197
» Reduction Relations for Agent Models
Sort
View
AAAI
2004
15 years 2 months ago
Hiding Satisfying Assignments: Two Are Better than One
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
Dimitris Achlioptas, Haixia Jia, Cristopher Moore
98
Voted
AAAI
2004
15 years 2 months ago
SAT-Based Answer Set Programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
AAAI
2006
15 years 2 months ago
OntoSearch: A Full-Text Search Engine for the Semantic Web
OntoSearch, a full-text search engine that exploits ontological knowledge for document retrieval, is presented in this paper. Different from other ontology based search engines, O...
Xing Jiang, Ah-Hwee Tan
83
Voted
AAAI
2006
15 years 2 months ago
Predicting Task-Specific Webpages for Revisiting
With the increased use of the web has come a corresponding increase in information overload that users face when trying to locate specific webpages, especially as a majority of vi...
Arwen Twinkle Lettkeman, Simone Stumpf, Jed Irvine...
105
Voted
AAAI
2000
15 years 2 months ago
The Game of Hex: An Automatic Theorem Proving Approach to Game Programming
The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree...
Vadim V. Anshelevich