Reasoning about Study Regulations in Answer Set Programming

• URL: http://arxiv.org/abs/2408.04528v1
• Date: Thu, 8 Aug 2024 15:27:22 GMT
• Title: Reasoning about Study Regulations in Answer Set Programming
• Authors: Susana Hahn, Cedric Martens, Amade Nemes, Henry Otunuya, Javier Romero, Torsten Schaub, Sebastian Schellhorn,
• Abstract summary: We propose an encoding of study regulations in Answer Set Programming that produces corresponding study plans. We show how this approach can be extended to a generic user interface for exploring study plans.
• Score: 1.605808266512203
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We are interested in automating reasoning with and about study regulations, catering to various stakeholders, ranging from administrators, over faculty, to students at different stages. Our work builds on an extensive analysis of various study programs at the University of Potsdam. The conceptualization of the underlying principles provides us with a formal account of study regulations. In particular, the formalization reveals the properties of admissible study plans. With these at end, we propose an encoding of study regulations in Answer Set Programming that produces corresponding study plans. Finally, we show how this approach can be extended to a generic user interface for exploring study plans.

Related papers

• Understanding the planning of LLM agents: A survey [98.82513390811148]
  This survey provides the first systematic view of LLM-based agents planning, covering recent works aiming to improve planning ability. Comprehensive analyses are conducted for each direction, and further challenges in the field of research are discussed.
  arXiv  Detail & Related papers  (2024-02-05T04:25:24Z)
• Towards Goal-oriented Intelligent Tutoring Systems in Online Education [69.06930979754627]
  We propose a new task, named Goal-oriented Intelligent Tutoring Systems (GITS) GITS aims to enable the student's mastery of a designated concept by strategically planning a customized sequence of exercises and assessment. We propose a novel graph-based reinforcement learning framework, named Planning-Assessment-Interaction (PAI)
  arXiv  Detail & Related papers  (2023-12-03T12:37:16Z)
• Extracting Rules from Event Data for Study Planning [5.305245019481161]
  We employ process and data mining techniques to explore the impact of sequences of taken courses on academic success. The evaluation focuses on RWTH Aachen University computer science bachelor program students.
  arXiv  Detail & Related papers  (2023-10-04T11:14:51Z)
• Hierarchical Programmatic Reinforcement Learning via Learning to Compose Programs [58.94569213396991]
  We propose a hierarchical programmatic reinforcement learning framework to produce program policies. By learning to compose programs, our proposed framework can produce program policies that describe out-of-distributionally complex behaviors. The experimental results in the Karel domain show that our proposed framework outperforms baselines.
  arXiv  Detail & Related papers  (2023-01-30T14:50:46Z)
• A Combined Approach of Process Mining and Rule-based AI for Study Planning and Monitoring in Higher Education [7.379617772613231]
  This paper presents an approach of using methods of process mining and rule-based artificial intelligence to analyze and understand study paths of students based on campus management system data and study program models. Process mining techniques are used to characterize successful study paths, as well as to detect and visualize deviations from expected plans. These insights are combined with recommendations and requirements of the corresponding study programs extracted from examination regulations.
  arXiv  Detail & Related papers  (2022-11-22T11:32:05Z)
• Towards Automated Process Planning and Mining [77.34726150561087]
  We present a research project in which researchers from the AI and BPM field work jointly together. We discuss the overall research problem, the relevant fields of research and our overall research framework to automatically derive process models.
  arXiv  Detail & Related papers  (2022-08-18T16:41:22Z)
• Answer Set Planning: A Survey [6.348684258418859]
  The development of efficient and scalable answer set solvers has provided a boost to the development of ASP-based planning systems. The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research.
  arXiv  Detail & Related papers  (2022-02-11T17:42:47Z)
• A Consciousness-Inspired Planning Agent for Model-Based Reinforcement Learning [104.3643447579578]
  We present an end-to-end, model-based deep reinforcement learning agent which dynamically attends to relevant parts of its state. The design allows agents to learn to plan effectively, by attending to the relevant objects, leading to better out-of-distribution generalization.
  arXiv  Detail & Related papers  (2021-06-03T19:35:19Z)
• Divide-and-Conquer Monte Carlo Tree Search For Goal-Directed Planning [78.65083326918351]
  We consider alternatives to an implicit sequential planning assumption. We propose Divide-and-Conquer Monte Carlo Tree Search (DC-MCTS) for approximating the optimal plan. We show that this algorithmic flexibility over planning order leads to improved results in navigation tasks in grid-worlds.
  arXiv  Detail & Related papers  (2020-04-23T18:08:58Z)

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.