Automata Techniques for Temporal Answer Set Programming

• URL: http://arxiv.org/abs/2109.08279v1
• Date: Fri, 17 Sep 2021 01:43:31 GMT
• Title: Automata Techniques for Temporal Answer Set Programming
• Authors: Susana Hahn
• Abstract summary: Temporal and dynamic extensions of Answer Set Programming (ASP) have played an important role in addressing dynamic problems. I intend to exploit the relationship between automata theory and dynamic logic to add automata-based techniques to the ASP solver CLINGO.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Temporal and dynamic extensions of Answer Set Programming (ASP) have played an important role in addressing dynamic problems, as they allow the use of temporal operators to reason with dynamic scenarios in a very effective way. In my Ph.D. research, I intend to exploit the relationship between automata theory and dynamic logic to add automata-based techniques to the ASP solver CLINGO helping us to deal with theses type of problems.

Related papers

• Asynchronous Tool Usage for Real-Time Agents [61.3041983544042]
  We introduce asynchronous AI agents capable of parallel processing and real-time tool-use. Our key contribution is an event-driven finite-state machine architecture for agent execution and prompting. This work presents both a conceptual framework and practical tools for creating AI agents capable of fluid, multitasking interactions.
  arXiv  Detail & Related papers  (2024-10-28T23:57:19Z)
• Sparse Diffusion Policy: A Sparse, Reusable, and Flexible Policy for Robot Learning [61.294110816231886]
  We introduce a sparse, reusable, and flexible policy, Sparse Diffusion Policy (SDP) SDP selectively activates experts and skills, enabling efficient and task-specific learning without retraining the entire model. Demos and codes can be found in https://forrest-110.io/sparse_diffusion_policy/.
  arXiv  Detail & Related papers  (2024-07-01T17:59:56Z)
• Efficient Orchestrated AI Workflows Execution on Scale-out Spatial Architecture [17.516934379812994]
  We present "Orchestrated AIs," an approach that integrates various tasks with logic-driven decisions into dynamic, sophisticated AIs. We find that the intrinsic Dual Dynamicity of Orchestrated AIs can be effectively represented using the Orchestrated spatial Graph. Our evaluations demonstrate that significantly outperforms traditional architectures in handling the dynamic demands of Orchestrated AIs.
  arXiv  Detail & Related papers  (2024-05-21T14:09:31Z)
• AutoAct: Automatic Agent Learning from Scratch for QA via Self-Planning [54.47116888545878]
  AutoAct is an automatic agent learning framework for QA. It does not rely on large-scale annotated data and synthetic planning trajectories from closed-source models.
  arXiv  Detail & Related papers  (2024-01-10T16:57:24Z)
• ProAgent: From Robotic Process Automation to Agentic Process Automation [87.0555252338361]
  Large Language Models (LLMs) have emerged human-like intelligence. This paper introduces Agentic Process Automation (APA), a groundbreaking automation paradigm using LLM-based agents for advanced automation. We then instantiate ProAgent, an agent designed to craft from human instructions and make intricate decisions by coordinating specialized agents.
  arXiv  Detail & Related papers  (2023-11-02T14:32:16Z)
• AutoML-GPT: Automatic Machine Learning with GPT [74.30699827690596]
  We propose developing task-oriented prompts and automatically utilizing large language models (LLMs) to automate the training pipeline. We present the AutoML-GPT, which employs GPT as the bridge to diverse AI models and dynamically trains models with optimized hyper parameters. This approach achieves remarkable results in computer vision, natural language processing, and other challenging areas.
  arXiv  Detail & Related papers  (2023-05-04T02:09:43Z)
• AutoDOViz: Human-Centered Automation for Decision Optimization [20.114066563594125]
  We present AutoDOViz, an interactive user interface for automated decision optimization (AutoDO) using reinforcement learning (RL) We report our findings from semi-structured expert interviews with DO practitioners as well as business consultants.
  arXiv  Detail & Related papers  (2023-02-19T23:06:19Z)
• Automata for dynamic answer set solving: Preliminary report [0.0]
  We explore different ways of implementing temporal constraints expressed in an extension of Answer Set Programming (ASP) with language constructs from dynamic logic. The idea is to transform a dynamic constraint into an automaton expressed in terms of a logic program that enforces the satisfaction of the original constraint.
  arXiv  Detail & Related papers  (2021-09-04T03:58:12Z)
• COCOI: Contact-aware Online Context Inference for Generalizable Non-planar Pushing [87.7257446869134]
  General contact-rich manipulation problems are long-standing challenges in robotics. Deep reinforcement learning has shown great potential in solving robot manipulation tasks. We propose COCOI, a deep RL method that encodes a context embedding of dynamics properties online.
  arXiv  Detail & Related papers  (2020-11-23T08:20:21Z)
• Implementing Dynamic Answer Set Programming [0.0]
  We develop a translation of dynamic formulas into temporal logic programs. The reduction of dynamic formulas to temporal logic programs allows us to extend ASP with both approaches in a uniform way.
  arXiv  Detail & Related papers  (2020-02-17T12:34:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.