Sciweavers

2436 search results - page 118 / 488
» Comonadic Notions of Computation
Sort
View
PEPM
2007
ACM
15 years 10 months ago
Quasi-terminating logic programs for ensuring the termination of partial evaluation
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Germán Vidal
VLDB
2005
ACM
175views Database» more  VLDB 2005»
15 years 9 months ago
Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces
The skyline operator is important for multicriteria decision making applications. Although many recent studies developed efficient methods to compute skyline objects in a specifi...
Jian Pei, Wen Jin, Martin Ester, Yufei Tao
ACSC
2003
IEEE
15 years 9 months ago
Symbol Grounding and its Implications for Artificial Intelligence
In response to Searle's well-known Chinese room argument against Strong AI (and more generally, computationalism), Harnad proposed that if the symbols manipulated by a robot ...
Michael J. Mayo
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 4 months ago
The Complexity of Causality and Responsibility for Query Answers and non-Answers
An answer to a query has a well-defined lineage expression (alternatively called how-provenance) that explains how the answer was derived. Recent work has also shown how to comput...
Alexandra Meliou, Wolfgang Gatterbauer, Katherine ...
ICAS
2008
IEEE
227views Robotics» more  ICAS 2008»
15 years 10 months ago
The 4C Reference Model for Distributed User Interfaces
Distributed User Interfaces (DUIs) are those interfaces whose different parts can be distributed in time and space on different monitors, screens, and computing platforms, dependi...
Alexandre Demeure, Jean-Sebastien Sottet, Gaë...