preprint · Research Explorer (The University of Manchester)
Untitled
Cited by 0Abstract and details only
Abstract
We consider the following query answering problem: Given a Boolean conjunctive query and a theory in the Horn loosely guarded fragment, the aim is to determine whether the query is entailed by the theory. In this paper, we present a resolution decision procedure for the loosely guarded fragment, and use such a procedure to answer Boolean conjunctive queries against the Horn loosely guarded fragment. The Horn loosely guarded fragment subsumes classes of rules that are prevalent in ontology-based query answering, such as Horn ALCHOI and guarded existential rules. Additionally, we identify star queries and cloud queries, which using our procedure, can be answered against the loosely guarded fragment.
Cite this paper
Zheng, S., & Schmidt, R. A. (n.d.). Untitled. Research Explorer (The University of Manchester).
Zheng, Sen, and Renate A. Schmidt. “Untitled.” Research Explorer (The University of Manchester).
Zheng, Sen, and Renate A. Schmidt. n.d.. “Untitled.” Research Explorer (The University of Manchester).
Zheng, S. and Schmidt, R.A. (n.d.) ‘Untitled’, Research Explorer (The University of Manchester).
@misc{zhenguntitled,
title = {{Untitled}},
author = {Zheng, Sen and Schmidt, Renate A.},
journal = {Research Explorer (The University of Manchester)}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Lower Bound of Maximal Horn of Horn Clause Set Σ
Zheng Pei · Xihua Daxue xuebao. Zhexue shehui kexue ban · 2012
Cited by 0
The horn basis of a set of clauses
Jean-Jacques Hébrard, Philippe Luquet · The Journal of Logic Programming · 1998
Cited by 1Open access
Disjunctions of Horn Theories and Their Cores
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino · Lecture notes in computer science · 1998
Cited by 5
A Concise Horn Theory for RCC8
Matthias Westphal, Julien Hué · Frontiers in artificial intelligence and applications · 2014
Cited by 2Open access
Erratum: The Satisfiability Problem for a Class Consisting of Horn Sentences and Non-Horn Sentences in Proportional Logic
Susumu Yamasaki, Shuji Doshita · Information and Computation · 1984
Cited by 0
Characterizability in Horn Belief Revision
Jon Yaggie, György Turán · Lecture notes in computer science · 2016
Cited by 1
New Results for Horn Cores and Envelopes of Horn Disjunctions
Thomas Eiter, Kazuhisa Makino · Frontiers in artificial intelligence and applications · 2008
Cited by 0