An assistive embodied AI agent often has to collaborate with previously unseen humans. State of the art frameworks for such ad hoc teamwork use a large labeled dataset of prior observations to model the behavior of ot...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
An assistive embodied AI agent often has to collaborate with previously unseen humans. State of the art frameworks for such ad hoc teamwork use a large labeled dataset of prior observations to model the behavior of other agents and to determine the ad hoc (i.e., embodied AI) agent's behavior. these approaches do not support rapid incremental revisions or transparency, and the necessary resources (e.g., training examples, computation) are not readily available in practical domains. Our previous work introduced an architecture that enabled an ad hoc agent to choose its actions in simple simulated domains based on non-monotonic logical reasoning with prior domain knowledge and models learned from limited examples to predict the behavior of other agents. Here, we extend this architecture to enable an ad hoc embodied AI agent to collaborate with a human performing household tasks in a complex indoor environment, focusing on the ad hoc agent's ability to identify and reason with relevant knowledge, and provide relational descriptions as explanations of its behavior and that of the human. We evaluate our architecture's capabilities in VirtualHome, a realistic 3D simulation environment.
Hydraulic engineering analysis of Water Distribution Systems (WDSs) is performed by running simulation softwares. the starting point to setup a simulation is to reconstruct the WDS topology. In many countries, includi...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Hydraulic engineering analysis of Water Distribution Systems (WDSs) is performed by running simulation softwares. the starting point to setup a simulation is to reconstruct the WDS topology. In many countries, including Italy, it often happens that data on the WDS is not readily available and accessible in digital format, and topology-reconstruction has to be carried out manually. this paper describes an application of Answer Set programming to partially automate the task of determining a WDS topology from geospatial data. Also, we report on a real-world use case that shows the feasibility of our approach.
Explainability in Artificial Intelligence (XAI) is crucial for enhancing the transparency and trustworthiness of AI systems. Our work focuses on providing clear explanations for why certain atoms in a given answer set...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Explainability in Artificial Intelligence (XAI) is crucial for enhancing the transparency and trustworthiness of AI systems. Our work focuses on providing clear explanations for why certain atoms in a given answer set are evaluated as such, hence contributing to the understanding of the decisions made by Answer Set programming (ASP) systems. We employ simple inference rules to elucidate these decisions, avoiding complex derivations to maintain clarity. Moreover, we introduce the notion of preferred unit-provable unsatisfiable subsets (preferred 1-PUS) to identify relevant portions of ASP encodings, prioritizing program rules over assignments, withthe objective of minimizing the assumptions involved in the explanation process. the proposed principles are implemented in a new XAI system.
In this paper, we present the integration of MiniZinc into ASP Chef, expanding its capabilities to include constraint programming alongside Answer Set programming (ASP). By leveraging the web assembly version of MiniZ...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
In this paper, we present the integration of MiniZinc into ASP Chef, expanding its capabilities to include constraint programming alongside Answer Set programming (ASP). By leveraging the web assembly version of MiniZinc, this integration allows for running MiniZinc models directly in the browser, eliminating the need for additional software installations. this browser-based approach is particularly advantageous for educational settings and rapid prototyping, offering a seamless and accessible environment for learners and practitioners. To facilitate the incorporation of MiniZinc in ASP recipes, we have implemented a mapping mechanism that converts facts to MiniZinc data and vice versa. this integration not only broadens the scope of problems that can be addressed using ASP Chef but also simplifies the workflow for users, making it a versatile tool for complex computational tasks.
this article explores the integration of Structured Declarative Language (SDL) into ASP Chef, a low-code web application designed to facilitate the development of pipelines for combinatorial search and optimization. S...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
this article explores the integration of Structured Declarative Language (SDL) into ASP Chef, a low-code web application designed to facilitate the development of pipelines for combinatorial search and optimization. SDL is a recent proposal aimed at simplifying the syntax of Answer Set programming (ASP), inspired by the straightforwardness of SQL. the integration is achieved through the implementation of a server that compiles SDL specifications into ASP programs and the addition of a new operation in ASP Chef to manage data exchange withthe server. this integration aims to streamline the development process and make it more accessible for users working on combinatorial optimization tasks.
the proceedings contain 30 papers. the special focus in this conference is on Nonmononic reasoning and Descriptive complexity. the topics include: On the complexity of theory curbing;graph operations and monadic secon...
ISBN:
(纸本)3540412859
the proceedings contain 30 papers. the special focus in this conference is on Nonmononic reasoning and Descriptive complexity. the topics include: On the complexity of theory curbing;graph operations and monadic second-order logic;efficient first order functional program interpreter with time bound certifications;encoding temporal logics in executable Z;behavioural constructor implementation for regular algebras;an extensible proof text editor;a tactic language for the system Coq;proof simplification for model generation and its applications;compiling and verifying security protocols;equational binary decision diagrams;a PVS proof obligation generator for lustre programs;efficient structural information analysis for real CLP languages;playing logic programs withthe alpha-beta algorithm;logicprogramming approaches for representing and solving constraint satisfaction problems;proof-search in implicative linear logic as a matching problem;a new model construction for the polymorphic lambda calculus;church’s lambda delta calculus;querying inconsistent databases;static reduction analysis for imperative object oriented languages;an abstract interpretation approach to termination of logic programs and using an abstract representation to specialize functional logic programs.
the fourthinternationalconference on logicprogramming and nonmonotonicreasoning (LPNMR) was held in Dagstuhl, Germany from the 28th to the 31st of July 1997. this year's installment of LPNMR reflected a new st...
详细信息
the fourthinternationalconference on logicprogramming and nonmonotonicreasoning (LPNMR) was held in Dagstuhl, Germany from the 28th to the 31st of July 1997. this year's installment of LPNMR reflected a new stage in the development of this cross-disciplinary field, with demonstrations of ten implemented system joining the submitted papers, invited talks and panel discussions. the details of the conference together withthe various topics tackled are presented.
In this paper we give a short introduction to logicprogramming approach to knowledge representation and reasoning. the intention is to help the reader to develop a 'feel' for the field's history and some ...
详细信息
In this paper we give a short introduction to logicprogramming approach to knowledge representation and reasoning. the intention is to help the reader to develop a 'feel' for the field's history and some of its recent developments. the discussion is mainly limited to logic programs under the answer set semantics. For understanding of approaches to logicprogramming built on well-founded semantics, general theories of argumentation, abductive reasoning, etc., the reader is referred to other publications. (C) 2002 Elsevier Science B.V. All rights reserved.
We give a logicprogramming based account of probability and describe a declarative language P-log capable of reasoning which combines bothlogical and probabilistic arguments. Several non-trivial examples illustrate ...
详细信息
ISBN:
(纸本)354020721X
We give a logicprogramming based account of probability and describe a declarative language P-log capable of reasoning which combines bothlogical and probabilistic arguments. Several non-trivial examples illustrate the use of P-log for knowledge representation.
the idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an answer set solver, such as SMODELS or DLV, to find an answ...
详细信息
the idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an answer set solver, such as SMODELS or DLV, to find an answer set for this program. Applications of this method to planning are related to the line of research on the frame problem that started withthe invention of formal nonmonotonicreasoning in 1980. (C) 2002 Elsevier Science B.V. All rights reserved.
暂无评论