793 search results - page 64 / 159 » Argumentation and standards of proof |
113
Voted
TLCA
2005
Springer
15 years 6 months ago
2005
Springer
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
92
Voted
SP
1998
IEEE
15 years 5 months ago
1998
IEEE
Current implementations of Java make security decisions by searching the runtime call stack. These systems have attractive security properties, but they have been criticized as be...
82
Voted
CCCG
2006
15 years 2 months ago
2006
Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex. Since Erdos posed this as an open problem in 1935, several independent purport...
95
Voted
IPL
2008
15 years 22 days ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
115
click to vote
IANDC
2007
15 years 21 days ago
2007
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...