Resource-conscious AI planning with conjunctions and disjunctions

Küngas Peep: Resource-conscious AI planning with conjunctions and disjunctions. In: Acta cybernetica, (15) 4. pp. 601-620. (2002)

[thumbnail of cybernetica_015_numb_004_601-620.pdf]
Cikk, tanulmány, mű

Download (1MB) | Preview


The aim of this work is to develop a resource-conscious Artificial Intelligence (AI) planning system, which allows for nondeterminism in the environment. Such planner has a potential in applications where actions in "real world" are considered. The planning process is based on proof search for a fragment of Linear Logic (LL) [10] sequents using a subset of LL rules. As LL is resourceconscious and has additive disjunction connective (represents nondeterminism), LL sequents are used to describe an application domain, whereby every LL sequent represents pre- and postconditions of a particular action execution. We present an idea to use Petri net reachability tree analysis for finding proofs for propositional LL sequents. Game playing is used to solve LL additive disjunctions. From LL proofs plans are extracted which because of underlying LL properties keep track of resources and handle both deterministic and nondeterministic actions.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2002
Volume: 15
Number: 4
ISSN: 0324-721X
Page Range: pp. 601-620
Language: English
Place of Publication: Szeged
Event Title: Finno-Ugoric Symposium on Programming Languages and Software Tools (7.) (2001) (Szeged)
Related URLs:
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 617-620. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 14. 14:32

Actions (login required)

View Item View Item