Handling irresolvable conflicts in the Semantic Web: an RDF-based conflict-tolerant version of the Deontic Traditional Scheme

• URL: http://arxiv.org/abs/2411.19918v1
• Date: Fri, 29 Nov 2024 18:33:28 GMT
• Title: Handling irresolvable conflicts in the Semantic Web: an RDF-based conflict-tolerant version of the Deontic Traditional Scheme
• Authors: Livio Robaldo, Gianluca Pozzato,
• Abstract summary: This paper presents a new ontology that implements the well-known Deontic Traditional Scheme in RDFs and SPARQL. The proposed framework is encoded in RDF, which is not only a first-order language but also the most widely used knowledge representation language. It offers constructs to model and reason with various types of irresolvable conflicts, violations, and the interaction between deontic modalities and contextual constraints.
• Score: 0.0
• License:
• Abstract: This paper presents a new ontology that implements the well-known Deontic Traditional Scheme in RDFs and SPARQL, fit to handle irresolvable conflicts, i.e., situations in which two or more statements prescribe conflicting obligations, prohibitions, or permissions, with none of them being "stronger" than the other one(s). In our view, this paper marks a significant advancement in standard theoretical research in formal Deontic Logic. Most contemporary approaches in this field are confined to the propositional level, mainly focus on the notion of obligation, and lack implementations. The proposed framework is encoded in RDF, which is not only a first-order language but also the most widely used knowledge representation language, as it forms the foundation of the Semantic Web. Moreover, the proposed computational ontology formalizes all deontic modalities defined in the Deontic Traditional Scheme, without specifically focusing on obligations, and offers constructs to model and reason with various types of irresolvable conflicts, violations, and the interaction between deontic modalities and contextual constraints in a given state of affairs. To the best of our knowledge, no existing approach in the literature addresses all these aspects within a unified integrated framework. All examples presented and discussed in this paper, together with Java code and clear instructions to re-execute them locally, are available at https://github.com/liviorobaldo/conflict-tolerantDeonticTraditionalScheme

Related papers

• Deliberative Alignment: Reasoning Enables Safer Language Models [64.60765108418062]
  We introduce Deliberative Alignment, a new paradigm that teaches the model safety specifications and trains it to explicitly recall and accurately reason over the specifications before answering. We used this approach to align OpenAI's o-series models, and achieved highly precise adherence to OpenAI's safety policies, without requiring human-written chain-of-thoughts or answers.
  arXiv  Detail & Related papers  (2024-12-20T21:00:11Z)
• Noise Contrastive Estimation-based Matching Framework for Low-Resource Security Attack Pattern Recognition [49.536368818512116]
  Tactics, Techniques and Procedures (TTPs) represent sophisticated attack patterns in the cybersecurity domain. We formulate the problem in a different learning paradigm, where the assignment of a text to a TTP label is decided by the direct semantic similarity between the two. We propose a neural matching architecture with an effective sampling-based learn-to-compare mechanism.
  arXiv  Detail & Related papers  (2024-01-18T19:02:00Z)
• The Problem of Alignment [1.2277343096128712]
  Large Language Models produce sequences learned as statistical patterns from large corpora. After initial training models must be aligned with human values, prefer certain continuations over others. We examine this practice of structuration as a two-way interaction between users and models.
  arXiv  Detail & Related papers  (2023-12-30T11:44:59Z)
• A Unifying Framework for Learning Argumentation Semantics [50.69905074548764]
  We present a novel framework, which uses an Inductive Logic Programming approach to learn the acceptability semantics for several abstract and structured argumentation frameworks in an interpretable way. Our framework outperforms existing argumentation solvers, thus opening up new future research directions in the area of formal argumentation and human-machine dialogues.
  arXiv  Detail & Related papers  (2023-10-18T20:18:05Z)
• A Deeper (Autoregressive) Approach to Non-Convergent Discourse Parsing [0.6599344783327052]
  We present a unified model for Non-Convergent Discourse Parsing that does not require any additional input other than the previous dialog utterances. Our model achieves results comparable with SOTA, without using label collocation and without training a unique architecture/model for each label.
  arXiv  Detail & Related papers  (2023-05-21T17:04:21Z)
• Towards Unification of Discourse Annotation Frameworks [0.0]
  We will investigate the systematic relations between different frameworks and devise methods of unifying the frameworks. Although the issue of framework unification has been a topic of discussion for a long time, there is currently no comprehensive approach. We plan to use automatic means for the unification task and evaluate the result with structural complexity and downstream tasks.
  arXiv  Detail & Related papers  (2022-04-16T11:34:00Z)
• DPCL: a Language Template for Normative Specifications [0.0]
  Legal core concepts have been proposed to systematize and relationships relevant to reasoning. No solution amongst those has achieved general acceptance, and no common ground (representational, computational) has been identified. This presentation will introduce DPCL, a domain-specific language (norms) for specifying higher-level policies.
  arXiv  Detail & Related papers  (2022-01-12T13:51:11Z)
• Towards Robustness Against Natural Language Word Substitutions [87.56898475512703]
  Robustness against word substitutions has a well-defined and widely acceptable form, using semantically similar words as substitutions. Previous defense methods capture word substitutions in vector space by using either $l$-ball or hyper-rectangle.
  arXiv  Detail & Related papers  (2021-07-28T17:55:08Z)
• Structured Latent Embeddings for Recognizing Unseen Classes in Unseen Domains [108.11746235308046]
  We propose a novel approach that learns domain-agnostic structured latent embeddings by projecting images from different domains. Our experiments on the challenging DomainNet and DomainNet-LS benchmarks show the superiority of our approach over existing methods.
  arXiv  Detail & Related papers  (2021-07-12T17:57:46Z)
• XAI Handbook: Towards a Unified Framework for Explainable AI [5.716475756970092]
  The field of explainable AI (XAI) has quickly become a thriving and prolific community. Each new contribution seems to rely on its own (and often intuitive) version of terms like "explanation" and "interpretation" We propose a theoretical framework that not only provides concrete definitions for these terms, but it also outlines all steps necessary to produce explanations and interpretations.
  arXiv  Detail & Related papers  (2021-05-14T07:28:21Z)
• BoxE: A Box Embedding Model for Knowledge Base Completion [53.57588201197374]
  Knowledge base completion (KBC) aims to automatically infer missing facts by exploiting information already present in a knowledge base (KB) Existing embedding models are subject to at least one of the following limitations. BoxE embeds entities as points, and relations as a set of hyper-rectangles (or boxes)
  arXiv  Detail & Related papers  (2020-07-13T09:40:49Z)

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.