Sciweavers

2529 search results - page 378 / 506
» The Logical Structure of Binding
Sort
View
ECAI
2006
Springer
15 years 10 months ago
Background Default Knowledge and Causality Ascriptions
A model is defined that predicts an agent's ascriptions of causality (and related notions of facilitation and justification) between two events in a chain, based on background...
Jean-François Bonnefon, Rui Da Silva Neves,...
FMCAD
2000
Springer
15 years 10 months ago
A Methodology for Large-Scale Hardware Verification
Abstract. We present a formal verification methodology for datapathdominated hardware. This provides a systematic but flexible framework within which to organize the activities und...
Mark Aagaard, Robert B. Jones, Thomas F. Melham, J...
CSL
1995
Springer
15 years 10 months ago
Deduction by Combining Semantic Tableaux and Integer Programming
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...
Bernhard Beckert, Reiner Hähnle
EURODAC
1995
IEEE
126views VHDL» more  EURODAC 1995»
15 years 10 months ago
Timing optimization by bit-level arithmetic transformations
This paper describes a method to optimize the performance of data paths. It is based on bit-level arithmetic transformations, and is especially suited to optimize large adder stru...
Luc Rijnders, Zohair Sahraoui, Paul Six, Hugo De M...
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 10 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge