liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Computing strongest necessary and weakest sufficient conditions of first-order formulas
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab.
2001 (English)In: 17th International Joint Conference on Artificial Intelligence,2001, San Francisco, CA, USA: Morgan Kaufmann Publishers Inc. , 2001, p. 145-151Conference paper, Published paper (Refereed)
Abstract [en]

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. p. 145-151
National Category
Computer Sciences
Identifiers
URN: 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
Conference
17th International Joint Conference on Artificial Intelligence, 4-10 August 2001, Seattle, Washington, United States
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2018-01-13

Open Access in DiVA

No full text in DiVA

Authority records BETA

Doherty, PatrickLukaszewicz, WitoldSzalas, Andrzej

Search in DiVA

By author/editor
Doherty, PatrickLukaszewicz, WitoldSzalas, Andrzej
By organisation
The Institute of TechnologyKPLAB - Knowledge Processing Lab
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 146 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf