Sciweavers

1187 search results - page 141 / 238
» Computation in Extended Argumentation Frameworks
Sort
View
IEICET
2007
110views more  IEICET 2007»
15 years 1 months ago
A Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
Keiichirou Kusakari, Yuki Chiba
137
Voted
ALP
1992
Springer
15 years 5 months ago
Definitional Trees
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
Sergio Antoy
DAC
2005
ACM
16 years 2 months ago
A quasi-convex optimization approach to parameterized model order reduction
In this paper an optimization based model order reduction (MOR) framework is proposed. The method involves setting up a quasiconvex program that explicitly minimizes a relaxation ...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
VLSID
2002
IEEE
129views VLSI» more  VLSID 2002»
16 years 2 months ago
Efficient Generation of Delay Change Curves for Noise-Aware Static Timing Analysis
In this paper, we explore the concept of using analytical models to efficiently generate delay change curves (DCCs) that can then be used to characterize the impact of noise on an...
Kanak Agarwal, Yu Cao, Takashi Sato, Dennis Sylves...
PODS
2004
ACM
115views Database» more  PODS 2004»
16 years 1 months ago
Foundations of Semantic Web Databases
The Semantic Web is based on the idea of adding more machine-readable semantics to web information via annotations written in a language called the Resource Description Framework ...
Claudio Gutiérrez, Carlos A. Hurtado, Alber...