Sciweavers

CSL
2006
Springer
14 years 4 months ago
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
Manuel Bodirsky, Hubie Chen
CSL
2006
Springer
14 years 4 months ago
Logical Omniscience Via Proof Complexity
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...
Sergei N. Artëmov, Roman Kuznets
CSL
2006
Springer
14 years 4 months ago
The Power of Linear Functions
Abstract. The linear lambda calculus is very weak in terms of expressive power: in particular, all functions terminate in linear time. In this paper we consider a simple extension ...
Sandra Alves, Maribel Fernández, Már...
CSL
2006
Springer
14 years 4 months ago
Abstracting Allocation
Nick Benton