4401 search results - page 398 / 881 » Computing with Default Logic |
149
click to vote
BIRTHDAY
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a rst-order sentence is preserved b...
132
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
The COL institution (constructor-based observational logic) has been introduced as a formal framework to specify both generationand observation-oriented properties of software syst...
188
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
147
click to vote
CADE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...
198
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
We propose a methodology for applying gate-level logic transformations to optimize power in digital circuits. Statistically simulated[14] switching information, gate delays, signa...