Sciweavers

CADE
2011
Springer
12 years 11 months ago
Compression of Propositional Resolution Proofs via Partial Regularization
This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivotsWithIntersection, performs partial regularization, re...
Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel ...
DLOG
2011
13 years 2 months ago
Goal-oriented Query Rewriting for OWL 2 QL
We present an optimized query rewriting algorithm for OWL 2 QL that computes the rewriting set of a user query by avoiding unnecessary inferences and extended clause subsumption ch...
Alexandros Chortaras, Despoina Trivela, Giorgos B....