Sciweavers

1220 search results - page 64 / 244
» Restricting grammatical complexity
Sort
View
AI
1998
Springer
13 years 7 months ago
The Logical Foundations of Goal-Regression Planning in Autonomous Agents
This paper addresses the logical foundations of goal-regression planning in autonomous rational agents. It focuses mainly on three problems. The first is that goals and subgoals w...
John L. Pollock
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
CORR
2010
Springer
106views Education» more  CORR 2010»
13 years 7 months ago
Spatial logics with connectedness predicates
Abstract. We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological c...
Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter...
CORR
2004
Springer
98views Education» more  CORR 2004»
13 years 7 months ago
A feasible algorithm for typing in Elementary Affine Logic
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
Patrick Baillot, Kazushige Terui
AI
2008
Springer
13 years 7 months ago
Theoretical analysis of singleton arc consistency and its extensions
Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but...
Christian Bessiere, Romuald Debruyne