2920 search results - page 90 / 584 » Finite information logic |
91
Voted
IGPL
2002
15 years 14 days ago
2002
The semantics of the independence friendly logic of Hintikka and Sandu is usually defined via a game of imperfect information. We give a definition in terms of a game of perfect i...
104
Voted
COLING
2000
15 years 2 months ago
2000
This paper describes an approach to using semantic rcprcsentations for learning information extraction (IE) rules by a type-oriented inductire logic programming (ILl)) system. NLP...
82
Voted
CORR
2008
Springer
15 years 24 days ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
110
click to vote
FOSSACS
2006
Springer
15 years 4 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
APAL
2010
15 years 25 days ago
2010
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...