Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Propositional default logics m...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
Propositional default logics made easier: computational complexity of model checking
Bibliographic Details
Main Authors:
Baumgartner, R
,
Gottlob, G
Format:
Journal article
Published:
2002
Holdings
Description
Similar Items
Staff View
Similar Items
On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases
by: Baumgartner, R, et al.
Published: (1999)
On the Computational Cost of Disjunctive Logic Programming: Propositional Case
by: Eiter, T, et al.
Published: (1995)
Cumulative Default Logic: Finite Characterization‚ Algorithms‚ and Complexity
by: Gottlob, G, et al.
Published: (1994)
Translating Default Logic into Standard Autoepistemic Logic
by: Gottlob, G
Published: (1995)
The Power of Beliefs or Translating Default Logic into Standard Autoepistemic Logic
by: Gottlob, G
Published: (1994)