Propositional default logics made easier: computational complexity of model checking. (Q1853549): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59259721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of complexity results for non-monotonic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational cost of disjunctive logic programming: Propositional case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Nonmonotonic Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of default reasoning under the stationary fixed point semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translating default logic into standard autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard problems for simple default logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank

Latest revision as of 11:28, 5 June 2024

scientific article
Language Label Description Also known as
English
Propositional default logics made easier: computational complexity of model checking.
scientific article

    Statements

    Propositional default logics made easier: computational complexity of model checking. (English)
    0 references
    0 references
    0 references
    21 January 2003
    0 references
    Reiter's default logic
    0 references
    Normal default theories
    0 references
    Computational complexity
    0 references
    Model checking
    0 references
    EHNF default theories
    0 references
    Weak extensions
    0 references

    Identifiers