liu.seSearch for publications in DiVA
Change search

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 circumscription revisited: A reduction algorithm.
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.
##### Abstract [en]

In recent years, a great deal of attention has been devoted to logics of "commonsense" reasoning. Among the candidates proposed, circumscription has been perceived as an elegant mathematical technique for modeling nonmonotonic reasoning, but difficult to apply in practice. The major reason for this is the nd-order nature of circumscription axioms and the difficulty in finding proper substitutions of predicate expressions for predicate variables.  One solution to this problem is to compile, where possible, nd-order formulas into equivalent 1st-order formulas. Although some progress has been made using this approach, the results are not as strong as one might desire and they are isolated in nature. In this article, we provide a general method which can be used in an algorithmic manner to reduce circumscription axioms to 1st-order formulas. The algorithm takes as input an arbitrary 2nd-order formula and either returns as output an equivalent 1st-order formula, or terminates with failure. The class of 2nd-order formulas, and analogously the class of circumscriptive theories which can be reduced, provably subsumes those covered by existing results. We demonstrate the generality of the algorithm using circumscriptive theories with mixed quantifiers (some involving Skolemization), variable constants, non-separated formulas, and formulas with n-ary predicate variables. In addition, we analyze the strength of the algorithm and compare it with existing approaches providing formal subsumption results.

##### Place, publisher, year, edition, pages
Linköping, Sweden: Department of Computer and Information Science, Linköping University , 1994.
##### Series
LITH-IDA-R, ISSN 0281-4250 ; 94-42
##### National Category
Computer Sciences
##### Identifiers
ISRN: LITH-IDA-R-94-42Local ID: 58857OAI: oai:DiVA.org:liu-41719DiVA, id: diva2:262573
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2018-01-12

#### 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
##### On the subject
Computer Sciences

urn-nbn

#### Altmetric score

urn-nbn
Total: 141 hits

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