The Complexity of Reasoning for Fragments of Default Logic
From MaRDI portal
Publication:3637157
DOI10.1007/978-3-642-02777-2_7zbMath1247.68263WikidataQ57998330 ScholiaQ57998330MaRDI QIDQ3637157
No author found.
Publication date: 7 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_7
Related Items
Parametrised Complexity of Satisfiability in Temporal Logic, On the applicability of Post's lattice, The complexity of circumscriptive inference in Post's lattice, The complexity of propositional implication
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of propositional implication
- On the relation between default and autoepistemic logic
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Reductions on NP and p-selective sets
- Hard problems for simple default logics
- Yet some more complexity results for default logic
- Satisfiability problems for propositional calculi
- Complexity Results for Nonmonotonic Logics
- Translating default logic into standard autoepistemic logic
- Complexity of Default Logic on Generalized Conjunctive Queries
- Sequent calculi for propositional nonmonotonic logics