Skip to Main content Skip to Navigation
Conference papers

Pointwise circumscription is equivalent to predicate completion (sometimes)

Yves Moinard 1
1 DREAM - Diagnosing, Recommending Actions and Modelling
Inria Rennes – Bretagne Atlantique , IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
Abstract : Two ways of minimizing positive information are predicate completion, which comes from logic programming theory, and circumscription, which is one of the best known methods of non-monotonic reasoning. Here, it is shown that, under certain hypothesis, there is equivalence between predicate completion and a special kind of circumscription.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-01162532
Contributor : Yves Moinard Connect in order to contact the contributor
Submitted on : Wednesday, June 10, 2015 - 5:08:53 PM
Last modification on : Tuesday, October 19, 2021 - 11:58:48 PM
Long-term archiving on: : Friday, September 11, 2015 - 1:41:07 PM

Identifiers

  • HAL Id : hal-01162532, version 1
`

Citation

Yves Moinard. Pointwise circumscription is equivalent to predicate completion (sometimes). Fifth International Conference of Logic Programming (ICLP 88), Aug 1988, Seattle, United States. ⟨hal-01162532⟩

Share

Metrics

Record views

400

Files downloads

155