371 search results - page 56 / 75 » Partition Theorems and Computability Theory |
GG
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
CADE
2005
Springer
15 years 10 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
PODS
2007
ACM
15 years 9 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
98
Voted
BIRTHDAY
2010
Springer
14 years 10 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...