CASP solutions for planning in hybrid domains

DOI10.1017/S1471068417000187zbMath1379.68039arXiv1704.03574OpenAlexW2606948271MaRDI QIDQ4593097

Marcello Balduccini, Emily LeBlanc, Daniele Magazzeni, Marco Maratea

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.03574

zbMATH Keywords

planninganswer set programminghybrid domains

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items

The Seventh Answer Set Programming Competition: Design and Results, A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning

Uses Software

• Clingcon
• COLIN

Cites Work

• Relating constraint answer set programming languages and algorithms
• Answer set based design of knowledge systems
• Integrating answer set programming and constraint logic programming
• Answer set programming and plan generation
• Logic programs with stable model semantics as a constraint programming paradigm
• Processes and continuous change in a SAT-based planner
• COLIN: Planning with Continuous Linear Numeric Change
• Plan-based Policies for Efficient Multiple Battery Load Management
• Iterative temporal motion planning for hybrid systems in partially unknown environments
• Model measuring for hybrid systems
• Abstraction, discretization, and robustness in temporal logic control of dynamical systems
• SMT-Based Analysis of Virtually Synchronous Distributed Hybrid Systems
• Falsification of LTL Safety Properties in Hybrid Systems
• Representing action and change by logic programs
• Knowledge Representation, Reasoning and Declarative Problem Solving
• ASP modulo CSP: The clingcon system
• Logic Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item