Computing the Scope of Applicability for Acquired Task Knowledge in Experience-Based Planning Domains
Experience-based planning domains have been proposed to improve problem solving by learning from experience. They rely on acquiring and using task knowledge, i.e., activity schemata, for generating solutions to problem instances in a class of tasks. Using Three-Valued Logic Analysis (TVLA), we extend previous work to generate a set of conditions that determine the scope of applicability of an activity schema. The inferred scope is a bounded representation of a set of problems of potentially unbounded size, in the form of a 3-valued logical structure, which is used to automatically find an applicable activity schema for solving task problems. We validate this work in two classical planning domains.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Learning Task Knowledge and its Scope of Applicability in Experience-Based Planning Domains
Experience-based planning domains (EBPDs) have been recently proposed to improve problem solving by learning from experience. EBPDs provide important concepts for long-term learning and planning in robotics. They rely on…
Compact and Robust Deep Learning Architecture for Fluorescence Lifetime Imaging and FPGA Implementation
This paper reported a bespoke adder-based deep learning network for time-domain fluorescence lifetime imaging (FLIM). By leveraging the l1-norm extraction method, we propose a 1-D Fluorescence Lifetime AdderNet (FLAN) wi…
QuantizationActive Learning for Robust and Representative LLM Generation in Safety-Critical Scenarios
Ensuring robust safety measures across a wide range of scenarios is crucial for user-facing systems. While Large Language Models (LLMs) can generate valuable data for safety measures, they often exhibit distributional bi…
Active LearningIncremental Updates of Generalized Hypertree Decompositions
Structural decomposition methods, such as generalized hypertree decompositions, have been successfully used for solving constraint satisfaction problems (CSPs). As decompositions can be reused to solve CSPs with the same…
validInteractive Learning of Hierarchical Tasks from Dialog with GPT
We present a system for interpretable, symbolic, interactive task learning from dialog using a GPT model as a conversational front-end. The learned tasks are represented as hierarchical decompositions of predicate-argume…