Autonomous Task Completion Based on Goal-directed Answer Set Programming

February 13, 2025 ยท The Ethereal ยท ๐Ÿ› Electronic Proceedings in Theoretical Computer Science

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Alexis R. Tudor arXiv ID 2502.09208 Category cs.LO: Logic in CS Cross-listed cs.SE Citations 0 Venue Electronic Proceedings in Theoretical Computer Science Last Checked 5 months ago
Abstract
Task planning for autonomous agents has typically been done using deep learning models and simulation-based reinforcement learning. This research proposes combining inductive learning techniques with goal-directed answer set programming to increase the explainability and reliability of systems for task breakdown and completion. Preliminary research has led to the creation of a Python harness that utilizes s(CASP) to solve task problems in a computationally efficient way. Although this research is in the early stages, we are exploring solutions to complex problems in simulated task completion.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS