The Complexity of Reasoning for Fragments of Default Logic (Q3637157): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Yet some more complexity results for default logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional implication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequent calculi for propositional nonmonotonic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Default Logic on Generalized Conjunctive Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Nonmonotonic Logics / 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: On the relation between default and autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard problems for simple default logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability problems for propositional calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscription - a form of non-monotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions on NP and p-selective sets / rank
 
Normal rank

Latest revision as of 18:58, 1 July 2024

scientific article
Language Label Description Also known as
English
The Complexity of Reasoning for Fragments of Default Logic
scientific article

    Statements