Wikidata Constraints on MARS (Extended Technical Report)

• URL: http://arxiv.org/abs/2008.03900v2
• Date: Mon, 17 Aug 2020 02:57:00 GMT
• Title: Wikidata Constraints on MARS (Extended Technical Report)
• Authors: David L. Martin, Peter F. Patel-Schneider
• Abstract summary: We show that nearly all Wikidata's existing property constraints can be completely characterized in a natural and economical fashion. We also give characterizations for several proposed property constraints, and show that a variety of non-property constraints can be handled in the same framework.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Wikidata constraints, albeit useful, are represented and processed in an incomplete, ad hoc fashion. Constraint declarations do not fully express their meaning, and thus do not provide a precise, unambiguous basis for constraint specification, or a logical foundation for constraint-checking implementations. In prior work we have proposed a logical framework for Wikidata as a whole, based on multi-attributed relational structures (MARS) and related logical languages. In this paper we explain how constraints are handled in the proposed framework, and show that nearly all of Wikidata's existing property constraints can be completely characterized in it, in a natural and economical fashion. We also give characterizations for several proposed property constraints, and show that a variety of non-property constraints can be handled in the same framework.

Related papers

• Disjointness Violations in Wikidata [0.0]
  We analyze the current modeling of disjointness on Wikidata. We use SPARQL queries to identify each culprit'' causing a disjointness violation and lay out formulas to identify and fix conflicting information.
  arXiv  Detail & Related papers  (2024-10-17T16:07:51Z)
• SRFUND: A Multi-Granularity Hierarchical Structure Reconstruction Benchmark in Form Understanding [55.48936731641802]
  We present the SRFUND, a hierarchically structured multi-task form understanding benchmark. SRFUND provides refined annotations on top of the original FUNSD and XFUND datasets. The dataset includes eight languages including English, Chinese, Japanese, German, French, Spanish, Italian, and Portuguese.
  arXiv  Detail & Related papers  (2024-06-13T02:35:55Z)
• ConstraintChecker: A Plugin for Large Language Models to Reason on Commonsense Knowledge Bases [53.29427395419317]
  Reasoning over Commonsense Knowledge Bases (CSKB) has been explored as a way to acquire new commonsense knowledge. We propose **ConstraintChecker**, a plugin over prompting techniques to provide and check explicit constraints.
  arXiv  Detail & Related papers  (2024-01-25T08:03:38Z)
• Controlled Text Generation with Natural Language Instructions [74.88938055638636]
  InstructCTG is a controlled text generation framework that incorporates different constraints. We first extract the underlying constraints of natural texts through a combination of off-the-shelf NLP tools and simple verbalizes. By prepending natural language descriptions of the constraints and a few demonstrations, we fine-tune a pre-trained language model to incorporate various types of constraints.
  arXiv  Detail & Related papers  (2023-04-27T15:56:34Z)
• Handling Wikidata Qualifiers in Reasoning [0.0]
  We show how to handle qualifiers in inference rules using Wikidata statements. We use a many-sorted logical language to formalize the Wikidata model. We show how to use the MSL and specification to reason on qualifiers.
  arXiv  Detail & Related papers  (2023-04-06T21:05:52Z)
• An ontology-aided, natural language-based approach for multi-constraint BIM model querying [0.0]
  This paper presents a novel ontology-aided semantic to automatically map natural language queries (NLQs) that contain different constraints into computer-readable codes for querying complex BIM models. A case study about the design-checking of a real-world residential building demonstrates the practical value of the proposed approach in the construction industry.
  arXiv  Detail & Related papers  (2023-03-27T11:35:40Z)
• COLD Decoding: Energy-based Constrained Text Generation with Langevin Dynamics [69.8062252611486]
  Cold decoding is a flexible framework that can be applied directly to off-the-shelf left-to-right language models. Our experiments on constrained generation tasks point to the effectiveness of our approach, both in terms of automatic and human evaluation.
  arXiv  Detail & Related papers  (2022-02-23T18:59:27Z)
• Wikidata on MARS [0.20305676256390934]
  Multi-attributed relational structures (MARSs) have been proposed as a formal data model for generalized property graphs. MARPL is a useful rule-based logic in which to write inference rules over property graphs. Wikidata can be modelled in an extended MARS that adds the (imprecise) datatypes of Wikidata.
  arXiv  Detail & Related papers  (2020-08-14T22:58:04Z)
• DART: Open-Domain Structured Data Record to Text Generation [91.23798751437835]
  We present DART, an open domain structured DAta Record to Text generation dataset with over 82k instances (DARTs) We propose a procedure of extracting semantic triples from tables that encode their structures by exploiting the semantic dependencies among table headers and the table title. Our dataset construction framework effectively merged heterogeneous sources from open domain semantic parsing and dialogue-act-based meaning representation tasks.
  arXiv  Detail & Related papers  (2020-07-06T16:35:30Z)
• An Integer Linear Programming Framework for Mining Constraints from Data [81.60135973848125]
  We present a general framework for mining constraints from data. In particular, we consider the inference in structured output prediction as an integer linear programming (ILP) problem. We show that our approach can learn to solve 9x9 Sudoku puzzles and minimal spanning tree problems from examples without providing the underlying rules.
  arXiv  Detail & Related papers  (2020-06-18T20:09:53Z)
• An ASP semantics for Constraints involving Conditional Aggregates [9.289905977910378]
  We elaborate upon the formal foundations of hybrid Answer Set Programming (ASP) We extend its underlying logical framework with aggregate functions over constraint values and variables. We put some emphasis on logic programs with linear constraints and show how common ASP aggregates can be regarded as particular cases of so-called conditional linear constraints.
  arXiv  Detail & Related papers  (2020-02-17T12:25:01Z)

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.