Sciweavers

1144 search results - page 123 / 229
» Logic programming for combinatorial problems
Sort
View
163
Voted
POPL
2010
ACM
15 years 12 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
132
Voted
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 6 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
125
Voted
CCS
2011
ACM
14 years 2 months ago
Automatically optimizing secure computation
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
Florian Kerschbaum
JAPLL
2010
124views more  JAPLL 2010»
15 years 1 months ago
Reasoning about XML with temporal logics and automata
We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of pr...
Leonid Libkin, Cristina Sirangelo
101
Voted
AIIA
1999
Springer
15 years 6 months ago
An Implementation for Abductive Logic Agents
This paper presents thedistributed implementationof ALIAS, an architecture composed of several cooperating intelligent agents. This system is particularly suited to solve problems ...
Anna Ciampolini, Evelina Lamma, Paola Mello, Cesar...