Sciweavers

244 search results - page 29 / 49
» A Way to Interpret Lukasiewicz Logic and Basic Logic
Sort
View
LICS
1991
IEEE
13 years 11 months ago
Defaults and Revision in Structured Theories
Starting from a logic which speci es how to make deductions from a set of sentences (a ` at theory'), a way to generalise this toa partiallyordered bag ofsentences (a `struct...
Mark Ryan
ISCI
2010
96views more  ISCI 2010»
13 years 6 months ago
Multi-adjoint t-concept lattices
The t-concept lattice is introduced as a set of triples associated to graded tabular information interpreted in a non-commutative fuzzy logic. Following the general techniques of ...
Jesús Medina, Manuel Ojeda-Aciego
TLCA
2007
Springer
14 years 1 months ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
Denis Cousineau 0002, Gilles Dowek
FUZZIEEE
2007
IEEE
14 years 1 months ago
Social Network and One-sided Fuzzy Concept Lattices
— In this paper we present information about our experiment with a social network of students from one school class. Each pupil has characterized his/her relationships to all sch...
Stanislav Krajci, Jana Krajciova
ICCD
1994
IEEE
157views Hardware» more  ICCD 1994»
13 years 11 months ago
Mesh Routing Topologies for Multi-FPGA Systems
There is currently great interest in using fixed arrays of FPGAs for logic emulators, custom computing devices, and software accelerators. An important part of designing such a sy...
Scott Hauck, Gaetano Borriello, Carl Ebeling