Sciweavers

736 search results - page 32 / 148
» High-order functions and their ordering relations
Sort
View
JELIA
1990
Springer
15 years 3 months ago
Semantic Interpretation as Higher-Order Deduction
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Fernando C. N. Pereira
SIAMIS
2010
283views more  SIAMIS 2010»
14 years 6 months ago
A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Var...
Ernie Esser, Xiaoqun Zhang, Tony F. Chan
JSAI
2005
Springer
15 years 5 months ago
Towards Ontologies of Functionality and Semantic Annotation for Technical Knowledge Management
Abstract. This research aims at promoting sharing of knowledge about functionality of artifacts among engineers, which tends to be implicit in practice. In order to provide a conce...
Yoshinobu Kitamura, Naoya Washio, Yusuke Koji, Rii...
TCS
2008
14 years 11 months ago
On a quasi-ordering on Boolean functions
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...
Miguel Couceiro, Maurice Pouzet
VLDB
1987
ACM
104views Database» more  VLDB 1987»
15 years 3 months ago
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
Georges Gardarin