Sciweavers

CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 8 months ago
Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
Barnaby Martin
CORR
2008
Springer
46views Education» more  CORR 2008»
13 years 8 months ago
On row-by-row coding for 2-D constraints
A constant-rate encoder
Ido Tal, Tuvi Etzion, Ron M. Roth
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 8 months ago
Communication Through Jamming over a Slotted ALOHA Channel
Sandeep Bhadra, Shreeshankar Bodas, Sanjay Shakkot...
CORR
2008
Springer
156views Education» more  CORR 2008»
13 years 8 months ago
Pairing Functions, Boolean Evaluation and Binary Decision Diagrams
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x...
Paul Tarau
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 8 months ago
Ranking and Unranking of Hereditarily Finite Functions and Permutations
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...
Paul Tarau
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 8 months ago
Executable Set Theory and Arithmetic Encodings in Prolog
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
Paul Tarau
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 8 months ago
Logics for the Relational Syllogistic
The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relationa...
Ian Pratt-Hartmann, Lawrence S. Moss
CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 8 months ago
Building a terminology network for search: the KoMoHe project
Philipp Mayr, Vivien Petras
CORR
2008
Springer
68views Education» more  CORR 2008»
13 years 8 months ago
Exhaustible sets in higher-type computation
Martín Hötzel Escardó