1888 search results - page 194 / 378 » Proof theory and computational analysis |
89
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
123
Voted
PLDI
2006
ACM
15 years 6 months ago
2006
ACM
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
110
Voted
ECCC
2008
15 years 26 days ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
127
click to vote
HEURISTICS
2006
15 years 24 days ago
2006
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
92
Voted
NJC
2006
15 years 22 days ago
2006
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...