the proceedings contain 21 papers. the topics discussed include: novel techniques in datalog optimization;certain answers of extensions of conjunctive queries by datalog and first-order rewriting;querying data exchang...
the proceedings contain 21 papers. the topics discussed include: novel techniques in datalog optimization;certain answers of extensions of conjunctive queries by datalog and first-order rewriting;querying data exchange settings beyond positive queries;new perspectives for fuzzy datalog;model checking verification of multilayer perceptrons in datalog: a many-valued approach with typicality;towards bridging traditional and smart contracts with datalog-based languages;datalog-based reasoning with heuristics over knowledge graphs;a rule-based constraint language for event streams;a formal comparison between datalog-based languages for stream reasoning;towards better understanding of the performance and design of datalog systems;and intelligent agents and complex event processing to enhance patient monitoring.
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.
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.
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.
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.
the proceedings contain 30 papers from the logic for programming, Artificial Intelligence, and reasoning: 10thinternationalconference, LPAR 2003. the topics discussed include: congruence closure with integer offsets...
详细信息
the proceedings contain 30 papers from the logic for programming, Artificial Intelligence, and reasoning: 10thinternationalconference, LPAR 2003. the topics discussed include: congruence closure with integer offsets;a machine-verified code generator;extensions of non-standard inferences to description logics with transitive roles;improving dependency pairs;extended caconicity of certain topological properties of set spaces;ordered diagnosis;minimizing automata on infinite words;automatic structures of bounded degree and strict geometry of interaction graph models.
the proceedings contain 30 papers. the special focus in this conference is on logic for programming, Artificial Intelligence, and reasoning. the topics include: From tableaux to automata for description logics;imperat...
ISBN:
(纸本)3540201017
the proceedings contain 30 papers. the special focus in this conference is on logic for programming, Artificial Intelligence, and reasoning. the topics include: From tableaux to automata for description logics;imperative object-based calculi in co-inductive type theories;congruence closure with integer offsets;a translation characterizing the constructive content of classical theories;extensions of non-standard inferences to description logics with transitive roles;extended canonicity of certain topological properties of set spaces;algebraic and model theoretic techniques for fusion decidability in modal logics;on closure under complementation of equational tree automata for theories extending ac;completeness of e-unification with eager variable elimination;handling equality in monodic temporal resolution;computing preferred answer sets in answer set programming;a syntax-based approach to reasoning about actions and events;minimizing automata on infinite words;accelerating proof search for zero-one linear constraint systems;NP-completeness results for deductive problems on stratified terms;automatic structures of bounded degree;an optimal automata approach to ltl model checking of probabilistic systems;a logical study on qualitative default reasoning with probabilities;strict geometry of interaction graph models and connection-based proof construction in non-commutative logic.
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.
this note summarizes the use of Answer Set programming to solve various computational problems to inter phylogenetic trees and phylogenetic networks, and discusses its applicability and effectiveness on some real taxa.
ISBN:
(纸本)9783642042379
this note summarizes the use of Answer Set programming to solve various computational problems to inter phylogenetic trees and phylogenetic networks, and discusses its applicability and effectiveness on some real taxa.
暂无评论