3172 search results - page 97 / 635 » On the Random-Self-Reducibility of Complete Sets |
168
Voted
PLDI
1997
ACM
15 years 5 months ago
1997
ACM
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
135
click to vote
JAR
2006
15 years 24 days ago
2006
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
113
Voted
ARSCOM
2007
15 years 29 days ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
94
Voted
CORR
2010
Springer
15 years 28 days ago
2010
Springer
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...
93
Voted
ADG
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...