1805 search results - page 96 / 361 » A Theory of Closure Operators |
130
click to vote
SIGSOFT
2005
ACM
16 years 5 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
122
click to vote
WWW
2003
ACM
16 years 5 months ago
2003
ACM
This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We ad...
126
click to vote
ICFCA
2007
Springer
15 years 10 months ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...
139
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
We present a general logic of explicit knowledge represented as finite sets of logical formulae which can evolve by nondeterministic reasoning and communication. It is partly bas...
123
click to vote
CALCO
2005
Springer
15 years 10 months ago
2005
Springer
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...