7988 search results - page 376 / 1598 » A Useful Undecidable Theory |
212
click to vote
POPL
1998
ACM
15 years 11 months ago
1998
ACM
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
187
click to vote
ECAI
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
157
click to vote
TPHOL
1997
IEEE
15 years 11 months ago
1997
IEEE
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
164
click to vote
VLSID
1994
IEEE
15 years 11 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
187
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...