1941 search results - page 361 / 389 » Reasoning about Computations Using Two-Levels of Logic |
135
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
141
click to vote
CHI
2007
ACM
16 years 3 months ago
2007
ACM
In order to develop intelligent systems that attain the trust of their users, it is important to understand how users perceive such systems and develop those perceptions over time...
122
Voted
COCO
2004
Springer
15 years 9 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
172
Voted
AI
2011
Springer
14 years 10 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
142
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...