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

Doherty, Patrick; Lukaszewicz, Witold; Szalas, Andrzej

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

Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas

Download BibTeX Cite

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 145-153.

Abstract

A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quantifier elimination techniques. The efficacy of the approach is demonstrated by using the techniques to compute snc’s and wsc’s for use in agent communication applications, theory approximation and generation of abductive hypotheses. Additionally, we generalize recent results involving the generation of successor state axioms in the propositional situation calculus via snc’s to the first-order case. Subsumption results for existing approaches to this problem and a re-interpretation of the concept of forgetting as a process of quantifier elimination are also provided.

Patrick Doherty, Witold Lukaszewicz, and Andrzej Szalas. 2001. Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01. IJCAI, 145–153. https://ijcai.org/proceedings/2001/20

@inproceedings{ijcai2001p20,
  title     = {Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas},
  author    = {Doherty, Patrick and Lukaszewicz, Witold and Szalas, Andrzej},
  booktitle = {Proceedings of the Seventeenth International Joint Conference on
               Artificial Intelligence, {IJCAI-01}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  pages     = {145--153},
  year      = {2001},
  url       = {https://ijcai.org/proceedings/2001/20},
}

TY  - CPAPER
TI  - Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
AU  - Doherty, Patrick
AU  - Lukaszewicz, Witold
AU  - Szalas, Andrzej
T2  - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2001
SP  - 145
EP  - 153
UR  - https://ijcai.org/proceedings/2001/20
ER  -