121 search results - page 13 / 25 » Elimination of Negation in a Logical Framework |
ECP
1997
Springer
13 years 11 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
CSL
2005
Springer
14 years 28 days ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— A fully-distributed collaborative multi-target tracking framework that eliminates the need for a central data associator or a central coordinating node for wireless sen...
KESAMSTA
2011
Springer
12 years 10 months ago
2011
Springer
Creating modular behaviours in JADE using a traditional method such as the FSM (Finite State Machine) can be a difficult task to achieve. The first issue with FSMs is that they do...
DSS
2002
13 years 7 months ago
2002
Recent research has sought to develop formal languages for business communication as more expressive, flexible and powerful alternatives to current electronic data interchange (ED...