REDUCED IMPLICATE TRIES AND LOGICAL OPERATIONS

Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal

2009

Abstract

The reduced implicate trie (ri-trie), introduced in (Murray and Rosenthal, 2005), is a target language for knowledge compilation. It has the property that any query can be processed in time linear in the size of the query. In this paper, conjunction and negation are developed as update operations for ri-tries that do not require recompilation. Conjunction has been implemented, and experimental results, though preliminary, are promising. Conjoining a formula to an existing ri-trie by compiling the new formula and conjoining the tries is generally more efficient than compiling the conjunction of the two formulas.

Paper Citation

in Harvard Style

Matusiewicz A., V. Murray N. and Rosenthal E. (2009). REDUCED IMPLICATE TRIES AND LOGICAL OPERATIONS . In Proceedings of the International Conference on Knowledge Engineering and Ontology Development - Volume 1: KEOD, (IC3K 2009) ISBN 978-989-674-012-2, pages 456-459. DOI: 10.5220/0002305204560459

in Bibtex Style

@conference{keod09,
author={Andrew Matusiewicz and Neil V. Murray and Erik Rosenthal},
title={REDUCED IMPLICATE TRIES AND LOGICAL OPERATIONS},
booktitle={Proceedings of the International Conference on Knowledge Engineering and Ontology Development - Volume 1: KEOD, (IC3K 2009)},
year={2009},
pages={456-459},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002305204560459},
isbn={978-989-674-012-2},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Knowledge Engineering and Ontology Development - Volume 1: KEOD, (IC3K 2009)
TI - REDUCED IMPLICATE TRIES AND LOGICAL OPERATIONS
SN - 978-989-674-012-2
AU - Matusiewicz A.
AU - V. Murray N.
AU - Rosenthal E.
PY - 2009
SP - 456
EP - 459
DO - 10.5220/0002305204560459