100 search results - page 7 / 20 » Multi-valued Logics, Effectiveness and Domains |
OPODIS
2003
13 years 9 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Action description languages, such as A and B [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a me...
CLIMA
2004
13 years 9 months ago
2004
An important branch of investigation in the field agents has been the definition of high level languages for representing effects of actions, the programs written in such languages...
IOLTS
2008
IEEE
14 years 2 months ago
2008
IEEE
Sets of Pairs of Functions to be Distinguished (SPFD) is a functional flexibility representation method that was recently introduced in the logic synthesis domain, and promises s...
TIME
1999
IEEE
13 years 12 months ago
1999
IEEE
We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus [5] and Kabanza [11], where domain-dependent search control knowledge represented as tem...