7 search results - page 2 / 2 » Logical Omniscience Via Proof Complexity |
195
Voted
POPL
2006
ACM
15 years 12 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
102
click to vote
PODS
2007
ACM
15 years 11 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...