Sciweavers

1888 search results - page 194 / 378
» Proof theory and computational analysis
Sort
View
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
16 years 7 months ago
Some 3CNF properties are hard to test
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...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
PLDI
2006
ACM
16 years 1 months ago
Specifying distributed trust management in LolliMon
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...
Jeff Polakow, Christian Skalka
ECCC
2008
122views more  ECCC 2008»
15 years 7 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
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,...
Itai Benjamini, Oded Schramm, Asaf Shapira
HEURISTICS
2006
102views more  HEURISTICS 2006»
15 years 7 months ago
A logic of soft constraints based on partially ordered preferences
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...
Nic Wilson
NJC
2006
86views more  NJC 2006»
15 years 7 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...