Sciweavers

778 search results - page 47 / 156
» Expressiveness and complexity of graph logic
Sort
View
123
Voted
DAC
1999
ACM
15 years 4 months ago
Circuit Complexity Reduction for Symbolic Analysis of Analog Integrated Circuits
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
Walter Daems, Georges G. E. Gielen, Willy M. C. Sa...
CSB
2005
IEEE
155views Bioinformatics» more  CSB 2005»
15 years 6 months ago
BioNavigation: Using Ontologies to Express Meaningful Navigational Queries Over Biological Resources
Exploiting the complex maze of publicly available Biological resources to implement scientific data collection pipelines poses a multitude of challenges to biologists in accurate...
Zoé Lacroix, Kaushal Parekh, Maria-Esther V...
DOCENG
2006
ACM
15 years 6 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda
76
Voted
ICLP
1999
Springer
15 years 4 months ago
CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
Yves Caseau, François-Xavier Josset, Fran&c...
TYPES
1993
Springer
15 years 4 months ago
The Expressive Power of Structural Operational Semantics with Explicit Assumptions
Abstract. We explore the expressive power of the formalism called Natural Operational Semantics, NOS, introduced by Burstall and Honsell for defining the operational semantics of ...
Marino Miculan