Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas

From Tetherless World Wiki

Jump to: navigation, search

\begin{bibtex} @inproceedings{DBLP:conf/ijcai/DohertyLS01, title={Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas}, pages={145-154}, year={2001}, crossref={DBLP:conf/ijcai/2001}, booktitle={IJCAI}, url={http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai2001.html#DohertyLS01}, author={Patrick Doherty and Witold Lukaszewicz and Andrzej Szalas} }\end{bibtex}

Retrieved from "http://tw.rpi.edu/wiki/Computing_Strongest_Necessary_and_Weakest_Sufficient_Conditions_of_First-Order_Formulas"
Personal tools