Polarity Guided Tractable Reasoning
Abstract
Non-clausal refinement of Boolean Constraint Propagation inference procedure for classical logic, called P-BCP, is introduced within a new knowledge representational formalism of polarized formulas. P-BCP is a sound, incomplete, and linear-time inference procedure. It is shown that P-BCP can be adopted for tractable reasoning in a number of non-classical logics (including some modal and finitely-valued logics).
Cite
Text
Stachniak. "Polarity Guided Tractable Reasoning." AAAI Conference on Artificial Intelligence, 1999.Markdown
[Stachniak. "Polarity Guided Tractable Reasoning." AAAI Conference on Artificial Intelligence, 1999.](https://mlanthology.org/aaai/1999/stachniak1999aaai-polarity/)BibTeX
@inproceedings{stachniak1999aaai-polarity,
title = {{Polarity Guided Tractable Reasoning}},
author = {Stachniak, Zbigniew},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1999},
pages = {751-758},
url = {https://mlanthology.org/aaai/1999/stachniak1999aaai-polarity/}
}