the proceedings contain 8 papers. the topics discussed include: explaining answers to datalog queries;DatalogMTL: datalog with metric temporal logic operators;incremental evaluation of dynamic datalog programs as a hi...
the proceedings contain 8 papers. the topics discussed include: explaining answers to datalog queries;DatalogMTL: datalog with metric temporal logic operators;incremental evaluation of dynamic datalog programs as a higher-order DBSP program;a tool for reasoning over CNL sentences with temporal constructs;experiencing hypothetical datalog in SQL puzzles;LLM-based DatalogMTL modelling of MiCAR-compliant crypto-assets markets;an exploration of datalog applications to language documentation and reclamation;and Nemo: a scalable and versatile datalog engine.
the proceedings contain 39 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Deep Learning for the Generation of Heuristics in Answer Set programming:...
ISBN:
(纸本)9783031157066
the proceedings contain 39 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Deep Learning for the Generation of Heuristics in Answer Set programming: A Case Study of Graph Coloring;a Qualitative Temporal Extension of Here-and-there logic;representing Abstract Dialectical Frameworks with Binary Decision Diagrams;Arguing Correctness of ASP Programs with Aggregates;Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination;IASCAR: Incremental Answer Set Counting by Anytime Refinement;reasoning About Actions with EL Ontologies and Temporal Answer Sets for DLTL;inference to the Stable Explanations;modal logic S5 in Answer Set programming with Lazy Creation of Worlds;Semantics for Conditional Literals via the SM Operator;state Transition in Multi-agent Epistemic Domains Using Answer Set programming;towards Provenance in Heterogeneous Knowledge Bases;Computing Smallest MUSes of Quantified Boolean Formulas;Pinpointing Axioms in Ontologies via ASP;interlinking logic Programs and Argumentation Frameworks;gradient-Based Supported Model Computation in Vector Spaces;towards Causality-Based Conflict Resolution in Answer Set Programs;xASP: An Explanation Generation System for Answer Set programming;Solving Problems in the Polynomial Hierarchy with ASP(Q);Enumeration of Minimal Models and MUSes in WASP;a Practical Account into Counting Dung’s Extensions by Dynamic programming;Clingraph: ASP-Based Visualization;A Machine Learning System to Improve the Performance of ASP Solving Based on Encoding Selection;QMaxSATpb: A Certified MaxSAT Solver;knowledge-Based Support for Adhesive Selection;ASP for Flexible Payroll Management;Analysis of Cyclic Fault Propagation via ASP;learning to Rank the Distinctiveness of Behaviour in Serial Offending;optimising Business Process Discovery Using Answer Set programming;DeduDeep: An Extensible Framework for Combining Deep Learning and ASP-Based Models;statis
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 answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. Strong equivalence of two programs can be sometimes established by deriving rules of each...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. Strong equivalence of two programs can be sometimes established by deriving rules of each program from rules of the other in an appropriate deductive system. this paper shows how to extend this method of proving strong equivalence to programs containing the counting aggregate.
ErgoAI (abbr. Ergo) is a high level, multi-paradigm logicprogramming language and system developed by Coherent Knowledge Systems as an enhancement of and a successor to the popular Flora-2 system. Ergo is oriented to...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
ErgoAI (abbr. Ergo) is a high level, multi-paradigm logicprogramming language and system developed by Coherent Knowledge Systems as an enhancement of and a successor to the popular Flora-2 system. Ergo is oriented towards scalable knowledge representation and reasoning, and can exploit both structured knowledge as well as knowledge derived from external sources such as vector embeddings. From the start, Ergo (and Flora-2 before it) were designed to exploit the well-founded semantics for reasoning in a multi-paradigm environment, including object-based logic (F-logic) with non-monotonic inheritance;higher order syntax in the style of HiLog;defeasibility of rules;semantically clean transactional updates;and extensive use of subgoal delay for better logical behavior and performance. Although Ergo programs are compiled into XSB and adopt many Prolog features, Ergo is altogether a different language with functionality equivalent to major Prologs.
Answer-set programming (ASP) is a declarative logicprogramming paradigm that provides an efficient problem-solving approach in logic-based artificial intelligence (AI). While it has proven successful, ASP encounters ...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Answer-set programming (ASP) is a declarative logicprogramming paradigm that provides an efficient problem-solving approach in logic-based artificial intelligence (AI). While it has proven successful, ASP encounters specific situations where its language falls short of accurately representing and reasoning about incomplete information. Researchers now widely agree that ASP requires powerful introspective reasoning withthe use of epistemic modal operators;yet, despite long-lasting debates on how to extend ASP with such operators, they cannot reach a consensus on satisfactory semantics. Cabalar et al. argue that such research should be grounded in formal robustness. thus, inspired by ASP's foundational properties, they introduce a structural principle called epistemic splitting and designate it as one of the compulsory criteria for epistemic ASP. this paper generalises their approach to a more comprehensive, meticulous, and conservative extension of ASP-splitting, thereby enhancing its applicability and efficiency.
Connections of intuitionistic and intermediate logics withlogicprogramming have been extensively studied in the literature. Among the different results in the literature we find equilibrium logic (Pearce, 1996) and ...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Connections of intuitionistic and intermediate logics withlogicprogramming have been extensively studied in the literature. Among the different results in the literature we find equilibrium logic (Pearce, 1996) and Safe beliefs (Osorio et al., 2005). Pearce's approach admits a characterisation in terms of a fixpoint (consequence) operator on the here-and-there intermediate logic (Heyting, 1930), which is similar to the notion of theory completion in default and autoepistemic logics. Osorio's safe beliefs are also given in terms of a fixpoint operator under intuitionistic logic semantics. In this latter case, intuitionistic logic can be replaced by any intermediate logic without altering the result. In this paper we consider temporal equilibrium logic, an combination of equilibrium logic and linear-time temporal logic. In this context we extend Pearce's and Osorio's approach to temporal case and we discuss the relation of intuitionistic temporal logic and temporal logicprogramming.
Recently forms of abstraction have been proposed for bothlogic programs (LPs) under the answer set semantics (ASP) and for the related formalism of assumption-based argumentation (ABA), e.g., via clustering of atoms ...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Recently forms of abstraction have been proposed for bothlogic programs (LPs) under the answer set semantics (ASP) and for the related formalism of assumption-based argumentation (ABA), e.g., via clustering of atoms or assumptions, in order to simplify a given LP or ABA framework. In both approaches after clustering the original answer sets and assumption sets are over-approximated, withthe aim of avoiding spuriousness. In contrast, in ASP a given LP is syntactically modified to achieve over-approximation, while on ABA the framework is minimally modified and the semantics is abstracted. In this work we follow the latter approach and provide a novel semantical abstraction for LPs and for ABA frameworks corresponding to LPs.
Petri nets are a class of models of computation used to compactly represent discrete event systems. Among many application domains, they have now become the most prominent formalism to express process models in Proces...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Petri nets are a class of models of computation used to compactly represent discrete event systems. Among many application domains, they have now become the most prominent formalism to express process models in Process Mining, thanks to their formal semantics that enables automated analysis techniques. In this context, model repair is the task of aligning a process model with actual executions of the process. Current solutions to model repair do not allow for embedding domain knowledge, providing guarantees of rigor, and enforcing structural requirements at the same time. In this paper, we fill this gap by proposing an approach based on the Inductive logicprogramming system ILASP. We then implement our approach and perform an experimental evaluation, showing both its expressiveness and feasibility.
Traditionally, in the argumentation theory literature structured arguments are constructed from rules interpretations aiming to build well-supported deductive evidence. Different from other approaches, we emphasize th...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Traditionally, in the argumentation theory literature structured arguments are constructed from rules interpretations aiming to build well-supported deductive evidence. Different from other approaches, we emphasize the role of investigating general frameworks that can also provide a consistent and well-defined justification for a conclusion that cannot be inferred and there is certainty about it, which we call here NAF-arguments, which have been less explored in the formal argumentation theory, despite its potential use in practical applications for building nuanced well-structured explanations and justifications. this article introduces the so-called semantic argumentation guaranteeing well-known principles for quality in structured argumentation, and withthe ability to generate two types of arguments, those where the conclusion atoms are semantically interpreted as true, and those where the conclusion is assumed to be false, we call them here semantic and NAF-arguments respectively. this framework is defined on the set of all logic programs in terms of rewriting systems based on a confluent set of transformation rules, the so-called Confluent logicprogramming Systems, making this approach a general framework. Additionally, we introduce a method for building such arguments using the program's strata through partial interpretations. We implement our framework named semantic argumentation solver available open source.
暂无评论