Computing strongest necessary and weakest sufficient conditions of first-order formulas
2001 (English)In: 17th International Joint Conference on Artificial Intelligence,2001, San Francisco, CA, USA: Morgan Kaufmann Publishers Inc. , 2001, 145-151 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
San Francisco, CA, USA: Morgan Kaufmann Publishers Inc. , 2001. 145-151 p.
IdentifiersURN: urn:nbn:se:liu:diva-41597Local ID: 58113ISBN: 1-55860-812-5 (print)ISBN: 978-1-558-60812-2 (print)OAI: oai:DiVA.org:liu-41597DiVA: diva2:262451
17th International Joint Conference on Artificial Intelligence, 4-10 August 2001, Seattle, Washington, United States