Analysing AI planning problems in linear logic -- a partial deduction approach

DOI10.1007/978-3-540-28645-5_6MaRDI QIDQ5311242zbMATH OpenOpenAlexFDO

Authors Peep Küngas

Publication date 22 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100195

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Logic in artificial intelligence (68T27)

Recommendations

• Abstraction within partial deduction for linear logic
• The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
• On linear logic planning and concurrency
• Linear deductive planning
• Linear logic as a tool for planning under temporal uncertainty

Cited in

(5)

• Coordination: Reo, Nets, and Logic
• Intelligent Backtracking in Plan-Based Deduction
• The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
• scientific article; zbMATH DE number 1912050 (Why is no real title available?)
• Abstraction within partial deduction for linear logic

This page was built for publication: Analysing AI planning problems in linear logic -- a partial deduction approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311242)