An ASP approach for reasoning on neural networks under a finitely many-valued semantics for weighted conditional knowledge bases

• URL: http://arxiv.org/abs/2202.01123v1
• Date: Wed, 2 Feb 2022 16:30:28 GMT
• Title: An ASP approach for reasoning on neural networks under a finitely many-valued semantics for weighted conditional knowledge bases
• Authors: Laura Giordano and Daniele Theseider Dupr\'e
• Abstract summary: We consider conditional ALC knowledge bases with typicality in the finitely many-valued case. We exploit ASP and "asprin" for reasoning with the concept-wise multipreferences.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Weighted knowledge bases for description logics with typicality have been recently considered under a "concept-wise" multipreference semantics (in both the two-valued and fuzzy case), as the basis of a logical semantics of MultiLayer Perceptrons (MLPs). In this paper we consider weighted conditional ALC knowledge bases with typicality in the finitely many-valued case, through three different semantic constructions, based on coherent, faithful and phi-coherent interpretations. For the boolean fragment LC of ALC we exploit ASP and "asprin" for reasoning with the concept-wise multipreference entailment under a phi-coherent semantics, suitable to characterize the stationary states of MLPs. As a proof of concept, we experiment the proposed approach for checking properties of trained MLPs.

Related papers

• A Note on an Inferentialist Approach to Resource Semantics [48.65926948745294]
  'Inferentialism' is the view that meaning is given in terms of inferential behaviour. This paper shows how 'inferentialism' enables a versatile and expressive framework for resource semantics.
  arXiv  Detail & Related papers  (2024-05-10T14:13:21Z)
• ConcEPT: Concept-Enhanced Pre-Training for Language Models [57.778895980999124]
  ConcEPT aims to infuse conceptual knowledge into pre-trained language models. It exploits external entity concept prediction to predict the concepts of entities mentioned in the pre-training contexts. Results of experiments show that ConcEPT gains improved conceptual knowledge with concept-enhanced pre-training.
  arXiv  Detail & Related papers  (2024-01-11T05:05:01Z)
• Interpreting Pretrained Language Models via Concept Bottlenecks [55.47515772358389]
  Pretrained language models (PLMs) have made significant strides in various natural language processing tasks. The lack of interpretability due to their black-box'' nature poses challenges for responsible implementation. We propose a novel approach to interpreting PLMs by employing high-level, meaningful concepts that are easily understandable for humans.
  arXiv  Detail & Related papers  (2023-11-08T20:41:18Z)
• Enriching Disentanglement: From Logical Definitions to Quantitative Metrics [59.12308034729482]
  Disentangling the explanatory factors in complex data is a promising approach for generalizable and data-efficient representation learning. We establish a theoretical connection between logical definitions of disentanglement and quantitative metrics using topos theory and enriched category theory. We empirically demonstrate the effectiveness of the proposed metrics by isolating different aspects of disentangled representations.
  arXiv  Detail & Related papers  (2023-05-19T08:22:23Z)
• A preferential interpretation of MultiLayer Perceptrons in a conditional logic with typicality [2.3103579794296736]
  Weighted knowledge bases for a simple description logic with typicality are considered under a (many-valued) concept-wise" multipreference semantics. The semantics is used to provide a preferential interpretation of MultiLayer Perceptrons (MLPs) A model checking and an entailment based approach are exploited in the verification of conditional properties ofLayers.
  arXiv  Detail & Related papers  (2023-04-29T17:15:36Z)
• Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learning [79.83792914684985]
  We prove a new identifiability result that provides conditions under which maximally sparse base-predictors yield disentangled representations. Motivated by this theoretical result, we propose a practical approach to learn disentangled representations based on a sparsity-promoting bi-level optimization problem.
  arXiv  Detail & Related papers  (2022-11-26T21:02:09Z)
• Guiding the PLMs with Semantic Anchors as Intermediate Supervision: Towards Interpretable Semantic Parsing [57.11806632758607]
  We propose to incorporate the current pretrained language models with a hierarchical decoder network. By taking the first-principle structures as the semantic anchors, we propose two novel intermediate supervision tasks. We conduct intensive experiments on several semantic parsing benchmarks and demonstrate that our approach can consistently outperform the baselines.
  arXiv  Detail & Related papers  (2022-10-04T07:27:29Z)
• From Weighted Conditionals of Multilayer Perceptrons to a Gradual Argumentation Semantics [0.0]
  A fuzzy multipreference semantics has been recently proposed for weighted conditional knowledge bases and used to develop a logical semantics for Multilayer Perceptrons. This semantics suggests some gradual argumentation semantics, which are related to the family of the gradual semantics.
  arXiv  Detail & Related papers  (2021-10-07T17:33:10Z)
• Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network model [0.0]
  We investigate the relationships between a multipreferential semantics for defeasible reasoning in knowledge representation and a deep neural network model. Weighted knowledge bases for description logics are considered under a "concept-wise" multipreference semantics.
  arXiv  Detail & Related papers  (2020-12-24T19:04:51Z)
• On a plausible concept-wise multipreference semantics and its relations with self-organising maps [0.0]
  We argue that this proposal satisfies some desired properties, such as KLM, and avoids the drowning problem. We motivate the plausibility of the concept-wise multi-preference semantics by developing a logical semantics of self-organising maps.
  arXiv  Detail & Related papers  (2020-08-30T21:06:06Z)
• An ASP approach for reasoning in a concept-aware multipreferential lightweight DL [0.0]
  We develop a concept aware multi-preferential semantics for dealing with typicality in description logics. The construction of the concept-aware multipreference semantics is related to Brewka's framework for qualitative preferences.
  arXiv  Detail & Related papers  (2020-06-08T07:15:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.