506 search results - page 26 / 102 » Constructor-based observational logic |
145
click to vote
TIME
1994
IEEE
15 years 9 months ago
1994
IEEE
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
179
Voted
AIIA
2005
Springer
15 years 11 months ago
2005
Springer
Machine Learning systems are often distinguished according to the kind of representation they use, which can be either propositional or first-order logic. The framework working wi...
150
click to vote
DAC
2005
ACM
15 years 7 months ago
2005
ACM
This paper presents a novel synthesis algorithm that reduces the area needed for implementing multiplexers on an FPGA by an average of 18%. This is achieved by reducing the number...
167
Voted
DAC
2010
ACM
15 years 9 days ago
2010
ACM
This paper presents a logic restructuring technique named node addition and removal (NAR). It works by adding a node into a circuit to replace an existing node and then removing t...
147
click to vote
VLSID
2007
IEEE
16 years 5 months ago
2007
IEEE
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...