176 search results - page 4 / 36 » Solving Goals in Equational Languages |
AIPS
2003
13 years 9 months ago
2003
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
QUESTA
2007
13 years 7 months ago
2007
: In this paper we study the Lindley-type equation W = max{0, B − A − W}. Its main characteristic is that it is a non-increasing monotone function in its main argument W. Our m...
CSCLP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
IANDC
2008
13 years 7 months ago
2008
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...