the proceedings contain 30 papers. the special focus in this conference is on logicprogramming and non-monotonicreasoning. the topics include: A Sequent Calculus for Generalized Inductive Definitions;tExplain: ...
ISBN:
(纸本)9783031742088
the proceedings contain 30 papers. the special focus in this conference is on logicprogramming and non-monotonicreasoning. the topics include: A Sequent Calculus for Generalized Inductive Definitions;tExplain: Information Extraction with Explanations;ASP-Based Large Neighborhood Prioritized Search for Course Timetabling;towards Industrial-Scale Product Configuration;An ILASP-Based Approach to Repair Petri Nets;abstract Dialectical Frameworks are Boolean Networks;Using Learning from Answer Sets for Robust Question Answering with LLM;Multi-paradigm logicprogramming in the ErgoAI System;An ASP-Based Approach to Water Distribution System Reconstruction;consequence Operators of Characterization logics – the Case of Abstract Argumentation;Efficiently Grounding FOL Using Bit Vectors;Integrating MiniZinc with ASP Chef: Browser-Based Constraint programming for Education and Prototyping;answer Set Explanations via Preferred Unit-Provable Unsatisfiable Subsets;Towards Mass Spectrum Analysis with ASP;monitoring and Scheduling of Semiconductor Failure Analysis Labs;a Semantical Approach to Abstraction in Answer Set programming and Assumption-Based Argumentation;on Forgetting in Assumption-Based Argumentation;Towards Explainable Weather Forecasting through FastLAS;semantic-Based Arguments Using logicprogramming Rewriting Systems;modelling Dialogues in a Concurrent Language for Argumentation;a Fixpoint Characterisation of Temporal Equilibrium logic;a Category-theoretic Perspective on Higher-Order Approximation Fixpoint theory;a Simulation for Supply Chains Contract Execution;reasoning and Explanation Generation in Ad Hoc Collaboration Between Humans and Embodied AI;policies, Penalties, and Autonomous Agents;LTLf2ASP: LTLf Bounded Satisfiability in ASP;Integrating Structured Declarative Language (SDL) into ASP Chef;a Generalisation of Epistemic Splitting Property.
the proceedings contain 45 papers. the topics discussed include: the complexity of partial-observation parity games;awareness in games, awareness in logic;human and unhuman commonsense reasoning;tableau calculus for t...
ISBN:
(纸本)364216241X
the proceedings contain 45 papers. the topics discussed include: the complexity of partial-observation parity games;awareness in games, awareness in logic;human and unhuman commonsense reasoning;tableau calculus for the logic of comparative similarity over arbitrary distance spaces;extended computation tree logic;using causal relationships to deal withthe ramification problem in action formalisms based on description logics;generating counterexamples for structural inductions by exploiting nonstandard models;characterizing space complexity classes via Knuth-Bendix orders;how to universally close the existential rule;magically constraining the inverse method using dynamic polarity assignment;lazy abstraction for size-change termination;a syntactical approach to qualitative constraint networks merging;on the satisfiability of two-variable logic over data words;and generic methods for formalizing sequent calculi applied to provability logic.
the proceedings contain 7 papers. the topics discussed include: care robots learning rules of ethical behavior under the supervision of an ethical teacher;a parallelization approach for hybrid-AI-based models: an appl...
the proceedings contain 7 papers. the topics discussed include: care robots learning rules of ethical behavior under the supervision of an ethical teacher;a parallelization approach for hybrid-AI-based models: an application study for semantic segmentation of medical images;towards inductive learning of domain-specific heuristics for ASP;mining sequences in phone recordings with answer set programming;estimation-based verification of cyber-physical systems via statistical model checking;explainability via short formulas: the case of propositional logic with implementation;and evaluating epistemic logic programs via answer set programming with quantifiers.
the proceedings contain 45 papers. the special focus in this conference is on logic for programming, Artificial Intelligence, and reasoning. the topics include: Characterising space complexity classes via Knuth-Bendix...
ISBN:
(纸本)9783642162411
the proceedings contain 45 papers. the special focus in this conference is on logic for programming, Artificial Intelligence, and reasoning. the topics include: Characterising space complexity classes via Knuth-Bendix orders;focused natural deduction;how to universally close the existential rule;on the Complexity of the Bernays-Schönfinkel Class with Datalog;magically constraining the inverse method using dynamic polarity assignment;lazy abstraction for size-change termination;a syntactical approach to qualitative constraint networks merging;on the satisfiability of two-variable logic over data words;generic methods for formalising sequent calculi applied to provability logic;awareness in games, awareness in logic;characterising probabilistic processes logically: (Extended abstract);fCube: An efficient prover for Intuitionistic propositional logic;superposition-Based Analysis of First-Order Probabilistic Timed Automata;A nonmonotonic extension of KLM Preferential logic P;on strong normalization of the Calculus of Constructions with type-based termination;aligators for arrays (tool paper);Clause elimination procedures for CNF formulas;Partitioning SAT instances for distributed solving;infinite families of finite string rewriting systems and their confluence;polite theories revisited;human and unhuman commonsense reasoning;clausal graph tableaux for hybrid logic with eventualities and difference;the consistency of the CADIAG-2 knowledge base: A probabilistic approach;on the Complexity of Model Expansion;labelled Unit Superposition Calculi for Instantiation-Based reasoning;Boosting local search thanks to CDCL;interpolating quantifier-free Presburger Arithmetic;variable compression in ProbLog;Improving resource-unaware SAT solvers;expansion nets: Proof-nets for propositional classical logic;revisiting matrix interpretations for polynomial derivational complexity of term rewriting;Gödel logics – A SURVEY;bottom-up tree automata with term constraints.
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.
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) withnon-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.
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.
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.
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-monotoniclogical 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.
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.
暂无评论