The paper presents a new approach of pulse generation which results in both wide range tunability and high accuracy of the output pulses. The concept is based on the use of programmable logic andâ€¦ (More)

This paper investigates a consistent versioncwa s of Reiter's closed-world assumptioncwa. It provides a syntactic characterization of minimal entailment âŠ¢ min : for every âˆ¨-sentence Ï• and for everyâ€¦ (More)

This paper investigates a consistent versions cwaS of sometimes inconsistent Reiterâ€™s closed world assumption cwa, proving (theorem 4.3) that for every âˆ€-sentence Ï† and for every âˆ€-theory Î£, Ï† âˆˆâ€¦ (More)

The minimal entailment âŠ¢Min has been characterized elsewhere by $$P \vdash _{{\text{Min}}} \varphi {\text{iff }}Cn(P \cup \{ \varphi \} ) \cap Pos \subseteq Cn(P),$$ where Cn is the first-orderâ€¦ (More)

This paper constitutes a brief study of the following scheme DA of default reasoning: Given set of premises , assume ' if and only if, for every 2 , [ f'g does not entail unless does, where and areâ€¦ (More)

This paper constitutes the second part of a paper published in the Journal of Automated Reasoning 18 (1997), 357â€“398. The minimal entailment âŠ¢ M i n has been characterized elsewhere by P âŠ¢ M i n Ï•â€¦ (More)

Main results. A rigorous proof that the number of comparisons of keys performed in the worst case by Heapsort on any array of size N â‰¥ 2 is equal to: 2(N âˆ’ 1) ( lg N âˆ’ 1 2 + Îµ )âˆ’ 2s2(N)âˆ’ e2(N) +â€¦ (More)