Sciweavers

384 search results - page 33 / 77
» Trust as dependence: a logical approach
Sort
View
ENTCS
2007
97views more  ENTCS 2007»
13 years 9 months ago
A Head-to-Head Comparison of de Bruijn Indices and Names
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
Stefan Berghofer, Christian Urban
LANMR
2004
13 years 10 months ago
New Semantics for Hybrid Probabilistic Programs
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
Emad Saad
CADE
2001
Springer
14 years 9 months ago
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
Xavier Urbain
RSCTC
2000
Springer
197views Fuzzy Logic» more  RSCTC 2000»
14 years 21 days ago
Rough Set Approach to CBR
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
Jan Wierzbicki
DATE
2000
IEEE
124views Hardware» more  DATE 2000»
14 years 1 months ago
On the Generation of Multiplexer Circuits for Pass Transistor Logic
Pass Transistor Logic has attracted more and more interest during last years, since it has proved to be an attractive alternative to static CMOS designs with respect to area, perf...
Christoph Scholl, Bernd Becker