Comparing planning domain models using answer set programming

DOI10.1007/978-3-031-43619-2_16MaRDI QIDQ6545534zbMATH OpenFDO

Authors Lukáš Chrpa, Carmine Dodaro, Marco Maratea, Mauro Vallati

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43619-2_16

zbMATH Keywords

answer set programmingautomated planningdomain model

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Logic Programming
• Engineering and compiling planning domain models to promote validity and efficiency
• On the importance of domain model configuration for automated planning engines
• scientific article; zbMATH DE number 1884393
• Domain-dependent knowledge in answer set planning

Cites work

• A distance measure between attributed relational graphs for pattern recognition
• ASP-Core-2 input language format
• Clingo goes linear constraints over reals and integers
• Engineering and compiling planning domain models to promote validity and efficiency
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• Inexact graph matching by means of estimation of distribution algorithms
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic programs with stable model semantics as a constraint programming paradigm
• Model reconciliation in logic programs
• Modelling mixed discrete-continuous domains for planning

Cited in

(1)

• On the importance of domain model configuration for automated planning engines

This page was built for publication: Comparing planning domain models using answer set programming

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