Linear temporal logic as an executable semantics for planning languages

DOI10.1007/s10849-006-9022-1zbMath1159.68562OpenAlexW1993457892WikidataQ58615466 ScholiaQ58615466MaRDI QIDQ1006453

Marta Cialdea Mayer, Valentina Poggioni, Carla Limongelli, Andrea Orlandini

Publication date: 24 March 2009

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-006-9022-1

zbMATH Keywords

Knowledge representationApplied temporal logicArtificial intelligence planning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Temporal logic (03B44)

Related Items (4)

Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\) ⋮ A compiler for MSVL and its applications ⋮ A temporal logic programming approach to planning ⋮ Experimental evaluation of pheromone models in ACOPlan

Uses Software

• Walksat
• PDDL

Cites Work

• Let's plan it deductively!
• Planning for temporally extended goals.
• Generating plans in linear logic. I: Actions as proofs
• Using temporal logics to express search control knowledge for planning
• STRIPS: A new approach to the application of theorem proving to problem solving
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear temporal logic as an executable semantics for planning languages