ML Anthology

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

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
IJCAI 2001 pp. 145-154
/ijcai/2001/doherty2001ijcai-computing/
Semantic Scholar

Cite

Text

Doherty et al. "Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas." International Joint Conference on Artificial Intelligence, 2001.

Markdown

[Doherty et al. "Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas." International Joint Conference on Artificial Intelligence, 2001.](https://mlanthology.org/ijcai/2001/doherty2001ijcai-computing/)

BibTeX

@inproceedings{doherty2001ijcai-computing,
  title     = {{Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas}},
  author    = {Doherty, Patrick and Lukaszewicz, Witold and Szalas, Andrzej},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2001},
  pages     = {145-154},
  url       = {https://mlanthology.org/ijcai/2001/doherty2001ijcai-computing/}
}