925 search results - page 54 / 185 » Connectivity on Complete Lattices |
NMR
2004
Springer
15 years 5 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
131
click to vote
LICS
1997
IEEE
15 years 4 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
125
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of ...
CONNECTION
2004
14 years 11 months ago
2004
While humans forget gradually, highly distributed connectionist networks forget catastrophically: newly learned information often completely erases previously learned information. ...
111
click to vote
TBILLC
2005
Springer
15 years 5 months ago
2005
Springer
Case attraction has stood as a puzzling, and elusive, oddity of older Indo-European languages. This paper focuses on attraction in Ancient Greek, establishing both the regularity o...