Sciweavers

2501 search results - page 38 / 501
» Logics with Rank Operators
Sort
View
CSL
2006
Springer
14 years 5 days 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
DAM
2008
125views more  DAM 2008»
13 years 8 months ago
Heyting algebras with Boolean operators for rough sets and information retrieval applications
This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of Rough Set concepts in particular...
Eric SanJuan
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 8 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...
JMLR
2010
135views more  JMLR 2010»
13 years 3 months ago
An Exponential Model for Infinite Rankings
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker will then typically r...
Marina Meila, Le Bao
LPNMR
2001
Springer
14 years 28 days ago
Multi-adjoint Logic Programming with Continuous Semantics
Abstract. Considering different implication operators, such as Lukasiewicz, G¨odel or product implication in the same logic program, naturally leads to the allowance of several a...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...