The data complexity of the syllogistic fragments of english

Camilo Thorne, Diego Calvanese

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Pratt and Third's syllogistic fragments of English can be used to capture, in addition to syllogistic reasoning, many other kinds of common sense reasoning, and, in particular (i) knowledge base consistency and (ii) knowledge base query answering, modulo their FO semantic representations. We show how difficult, in terms of semantic (computational) complexity and data complexity (i.e., computational complexity w.r.t. the number of instances declared in a knowledge base), such reasoning problems are. In doing so, we pinpoint also those fragments for which the reasoning problems are tractable (in PTime) or intractable (NP-hard or coNP-hard).

Original languageEnglish
Title of host publicationLogic, Language and Meaning - 17th Amsterdam Colloquium, Revised Selected Papers
Pages114-123
Number of pages10
DOIs
StatePublished - 2010
Externally publishedYes
Event17th Amsterdam Colloquium on Logic, Language and Meaning - Amsterdam, Netherlands
Duration: Dec 16 2009Dec 18 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6042 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th Amsterdam Colloquium on Logic, Language and Meaning
Country/TerritoryNetherlands
CityAmsterdam
Period12/16/0912/18/09

Fingerprint

Dive into the research topics of 'The data complexity of the syllogistic fragments of english'. Together they form a unique fingerprint.

Cite this