Sciweavers

2138 search results - page 186 / 428
» Logics for the Relational Syllogistic
Sort
View
TPHOL
2003
IEEE
14 years 1 months ago
Inductive Invariants for Nested Recursion
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
Sava Krstic, John Matthews
FOIS
2010
13 years 9 months ago
Revisiting the Ontological Square
Considerations regarding predication in ordinary language as well as the ontology of relations suggest a refinement of the Ontological Square, a conceptual scheme used in many foun...
Luc Schneider
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 8 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
ICASSP
2011
IEEE
13 years 6 hour ago
Belief theoretic methods for soft and hard data fusion
In many contexts, one is confronted with the problem of extracting information from large amounts of different types soft data (e.g., text) and hard data (from e.g., physics-based...
Thanuka Wickramarathne, Kamal Premaratne, Manohar ...
FSS
2006
140views more  FSS 2006»
13 years 8 months ago
Advances and challenges in interval-valued fuzzy logic
Among the various extensions to the common [0, 1]-valued truth degrees of "traditional" fuzzy set theory, closed intervals of [0, 1] stand out as a particularly appealin...
Chris Cornelis, Glad Deschrijver, Etienne E. Kerre