Differentiable logics (DL) have recently been proposed as a method of training neural networks to satisfy logical specifications. A DL consists of a syntax in which specifications are stated and an interpretation func...
详细信息
the proceedings contain 18 papers. the topics discussed include: towards legally and ethically correct online HTN planning for data transfer;repairing ontologies via kernel pseudo-contraction;trust graphs for belief r...
the proceedings contain 18 papers. the topics discussed include: towards legally and ethically correct online HTN planning for data transfer;repairing ontologies via kernel pseudo-contraction;trust graphs for belief revision: framework and implementation;bipolar argumentation frameworks with explicit conclusions: connecting argumentation and logicprogramming;conditional syntax splitting, lexicographic entailment and the drowning effect;truth-tracking with non-expert information sources;argumentation frameworks induced by assumption-based argumentation: relating size and complexity;and a situation-calculus model of knowledge and belief based on thinking about justifications.
there exist several results on deciding termination and computing runtime bounds for triangular weakly non-linear loops (twn-loops). We show how to use results on such subclasses of programs where complexity bounds ar...
详细信息
ISBN:
(纸本)9783031107696;9783031107689
there exist several results on deciding termination and computing runtime bounds for triangular weakly non-linear loops (twn-loops). We show how to use results on such subclasses of programs where complexity bounds are computable within incomplete approaches for complexity analysis of full integer programs. To this end, we present a novel modular approach which computes local runtime bounds for subprograms which can be transformed into twn-loops. these local runtime bounds are then lifted to global runtime bounds for the whole program. the power of our approach is shown by our implementation in the tool KoAT which analyzes complexity of programs where all other state-of-the-art tools fail.
Adding multi-modalities (called subexponentials) to linear logic enhances its power as a logical framework, which has been extensively used in the specification of e.g. proof systems, programming languages and bigraph...
详细信息
ISBN:
(纸本)9783031107696;9783031107689
Adding multi-modalities (called subexponentials) to linear logic enhances its power as a logical framework, which has been extensively used in the specification of e.g. proof systems, programming languages and bigraphs. Initially, subexponentials allowed for classical, linear, affine or relevant behaviors. Recently, this framework was enhanced so to allow for commutativity as well. In this work, we close the cycle by considering associativity. We show that the resulting system (acLL(Sigma)) admits the (multi)cut rule, and we prove two undecidability results for fragments/variations of acLL(Sigma).
We propose an algorithm based on satisfiability problem (SAT) solving for determining the contension inconsistency degree in propositional knowledge bases. In addition, we present a revised version of an algorithm bas...
详细信息
We present the system ALASPO which implements Adaptive Large-neighbourhood search for Answer Set programming (ASP) Optimisation. Large-neighbourhood search (LNS) is a meta-heuristic where parts of a solution are destr...
详细信息
the proceedings contain 21 papers. the topics discussed include: planning safe collaborative behaviors through risk-aware heuristic search;tabular model learning in Monte Carlo tree search;goal recognition with deep l...
the proceedings contain 21 papers. the topics discussed include: planning safe collaborative behaviors through risk-aware heuristic search;tabular model learning in Monte Carlo tree search;goal recognition with deep learning and embedded representation of state traces;investigating domain-oriented approaches to optimization in timeline-based planning;heuristic planning for hybrid dynamical systems with constraint logicprogramming;characterizing nexus of similarity between entities;a simple proof-theoretic characterization of stable models;experimenting an approach to neuro-symbolic RL;planning as theorem proving with heuristics;learning augmented online learning algorithms - the adversarial bandit with knapsacks framework;and optimal rates for online Bayesian persuasion.
Withthe development of artificialintelligence, statistical learning methods are widely used. Among all artificialintelligence problems, obtaining excellent training models through massive data mining and huge compu...
详细信息
Withthe development of artificialintelligence, statistical learning methods are widely used. Among all artificialintelligence problems, obtaining excellent training models through massive data mining and huge computing power is currently a hot topic. Although such statistical learning methods have shown great potential in academic and industrial applications, the causal logic of machine learning still has poor interpretability. In the factor space theory proposed in 1982, Professor Peizhuang Wang first proposed causal reasoning to find the relationship between causation and effect and created factor space to illustrate causal relationships. Factors play a vital role in the factor space, which can be applied in various scenarios. the projection method provides a way of thinking and perspective for finding factors by projecting the vectors in the n-dimensional real vector space R-n into subspace, and this method has great value in knowledge representation and causal reasoning. (C) 2021 the Authors. Published by Elsevier B.V.
the proceedings contain 39 papers. the special focus in this conference is on logicprogramming and Nonmonotonic reasoning. 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 Nonmonotonic reasoning. 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 11 papers. the special focus in this conference is on Software Verification and Formal Methods for ML-Enables Autonomous Systems. the topics include: Neural Network Precision Tuning Using Stoch...
ISBN:
(纸本)9783031212215
the proceedings contain 11 papers. the special focus in this conference is on Software Verification and Formal Methods for ML-Enables Autonomous Systems. the topics include: Neural Network Precision Tuning Using Stochastic Arithmetic;MLTL Multi-type (MLTLM): A logic for reasoning About Signals of Different Types;a Cascade of Checkers for Run-time Certification of Local Robustness;CEG4N: Counter-Example Guided Neural Network Quantization Refinement;minimal Multi-Layer Modifications of Deep Neural Networks;differentiable logics for Neural Network Training and Verification;neural Networks in Imandra: Matrix Representation as a Verification Choice;self-correcting Neural Networks for Safe Classification;formal Specification for Learning-Enabled Autonomous Systems;verified Numerical Methods for Ordinary Differential Equations.
暂无评论