Sciweavers

2145 search results - page 27 / 429
» Lax Logical Relations
Sort
View
LPAR
2004
Springer
14 years 1 months ago
Uniform Rules and Dialogue Games for Fuzzy Logics
Abstract. We provide uniform and invertible logical rules in a framework of relational hypersequents for the three fundamental t-norm based fuzzy logics i.e., Łukasiewicz logic, G...
Agata Ciabattoni, Christian G. Fermüller, Geo...
VLDB
1987
ACM
72views Database» more  VLDB 1987»
13 years 11 months ago
Providing Time-Related Constraints for Conventional Database Systems
A model for a historical database is described which is based upon time-stamped tuples as the unit of storage. The model includes both physical and logical time-stamps. The techni...
T. Abbod, K. Brown, H. Noble
AAAI
2006
13 years 9 months ago
kFOIL: Learning Simple Relational Kernels
A novel and simple combination of inductive logic programming with kernel methods is presented. The kFOIL algorithm integrates the well-known inductive logic programming system FO...
Niels Landwehr, Andrea Passerini, Luc De Raedt, Pa...
LICS
2010
IEEE
13 years 6 months ago
On Strong Maximality of Paraconsistent Finite-Valued Logics
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
Arnon Avron, Ofer Arieli, Anna Zamansky
FSS
2010
119views more  FSS 2010»
13 years 6 months ago
Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
Extensions of monoidal t-norm logic MTL and related fuzzy logics with truth stresser modalities such as globalization and “very true” are presented here both algebraically in ...
Agata Ciabattoni, George Metcalfe, Franco Montagna