Sciweavers

3342 search results - page 593 / 669
» Automating Abstract Interpretation
Sort
View
JELIA
1998
Springer
14 years 2 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
DAC
1997
ACM
14 years 2 months ago
System Level Fixed-Point Design Based on an Interpolative Approach
The design process for xed-point implementations either in software or in hardware requires a bit-true speci cation of the algorithm in order to analyze quantization e ects on an...
Markus Willems, Volker Bürsgens, Holger Kedin...
CAISE
1997
Springer
14 years 2 months ago
Towards Method-Driven Trace Capture
Abstract: Traceability is a prerequisite for managing the evolution of (software) systems. Assuring overall traceability of a system development process, i.e., capturing and interr...
Klaus Pohl, Ralf Dömges, Matthias Jarke
TAPSOFT
1997
Springer
14 years 2 months ago
Set Operations for Recurrent Term Schematizations
Abstract. Reasoning on programs and automated deduction often require the manipulation of in nite sets of objects. Many formalisms have been proposed to handle such sets. Here we d...
Ali Amaniss, Miki Hermann, Denis Lugiez
ECAI
1992
Springer
14 years 2 months ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen