• norsk
    • English
  • norsk 
    • norsk
    • English
  • Logg inn
Vis innførsel 
  •   Hjem
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Department of Informatics
  • Vis innførsel
  •   Hjem
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Department of Informatics
  • Vis innførsel
JavaScript is disabled for your browser. Some features of this site may not work without it.

Incompleteness of the Inference System BNeg

Golid, Kjetil Midtgarden
Master thesis
Thumbnail
Åpne
144798880.pdf (452.6Kb)
Permanent lenke
https://hdl.handle.net/1956/12644
Utgivelsesdato
2016-05-31
Metadata
Vis full innførsel
Samlinger
  • Department of Informatics [740]
Sammendrag
Any propositional discourse can be represented as a propositional theory in a specific form in such a way that the theory is inconsistent if and only if the discourse is paradoxical. Propositional theories in this form can be represented as directed graphs such that the models of the theory correspond to the kernels of the digraph. This thesis looks at Neg; a sound, refutationally complete, non-explosive resolution system over such propositional theories. We investigate the relation between various graph structures and clauses provable by the resolution system from the corresponding theory. The main results is a counter-example to a conjecture that a restricted version BNeg of the system is refutationally complete.
Utgiver
The University of Bergen
Opphavsrett
Copyright the Author. All rights reserved

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit
 

 

Bla i

Hele arkivetDelarkiv og samlingerUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifterDenne samlingenUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifter

Min side

Logg inn

Statistikk

Besøksstatistikk

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit