Sciweavers

330 search results - page 44 / 66
» Open Problems in Logic and Games
Sort
View
LICS
1999
IEEE
14 years 8 days ago
Towards a Theory of Bisimulation for Local Names
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
Alan Jeffrey, Julian Rathke
CADE
2005
Springer
14 years 8 months ago
Well-Nested Context Unification
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
Jordi Levy, Joachim Niehren, Mateu Villaret
FOCS
2006
IEEE
14 years 2 months ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
KR
2010
Springer
14 years 23 days ago
Status QIO: Conjunctive Query Entailment Is Decidable
Description Logics (DLs) are knowledge representation formalisms that provide, for example, the logical underpinning of the W3C OWL standards. Conjunctive queries (CQs), the stand...
Birte Glimm, Sebastian Rudolph
CADE
1997
Springer
13 years 11 months ago
A Classification of Non-liftable Orders for Resolution
In this paper we study the completeness of resolution when it is restricted by a non-liftable order and by weak subsumption. A non-liftable order is an order that does not satisfy...
Hans de Nivelle