The following pages link to (Q4273952):
Displaying 50 items.
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- Proof complexity of propositional default logic (Q647339) (← links)
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- Annotated nonmonotonic rule systems (Q673384) (← links)
- Evaluating the effect of semi-normality on the expressiveness of defaults (Q814438) (← links)
- A nonmonotonic observation logic (Q814611) (← links)
- On the complexity of extension checking in default logic (Q844157) (← links)
- Default theories over monadic languages (Q860840) (← links)
- Logic programs with abstract constraint atoms: the role of computations (Q969538) (← links)
- Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning (Q1024815) (← links)
- Default logic generalized and simplified (Q1028638) (← links)
- On the relation among answer set solvers (Q1028643) (← links)
- A non-preferential semantics of non-monotonic modal logic (Q1028644) (← links)
- Hyperequivalence of logic programs with respect to supported models (Q1028652) (← links)
- On the relation between default and modal nonmonotonic reasoning (Q1274266) (← links)
- Prolog technology for default reasoning: proof theory and compilation techniques (Q1275596) (← links)
- Recovery of (non)monotonic theories (Q1275600) (← links)
- Lexicographic priorities in default logic (Q1277698) (← links)
- Is default logic a reinvention of inductive-statistical reasoning? (Q1293025) (← links)
- Logic programs, well-orderings, and forward chaining (Q1295428) (← links)
- A context for belief revision: forward chaining-normal nonmonotonic rule systems (Q1326782) (← links)
- Querying disjunctive databases through nonmonotonic logics (Q1350535) (← links)
- Seminormal stratified default theories (Q1380425) (← links)
- Revision programming (Q1389448) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- Multi-interpretation operators and approximate classification. (Q1395581) (← links)
- Definability and commonsense reasoning (Q1402721) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- Abductive reasoning through filtering (Q1575426) (← links)
- Expressing preferences in default logic (Q1589465) (← links)
- Alternative foundations for Reiter's default logic (Q1589575) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
- On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) (← links)
- Propositional default logics made easier: computational complexity of model checking. (Q1853549) (← links)
- Uniform semantic treatment of default and autoepistemic logics (Q1853682) (← links)
- More on representation theory for default logic (Q1854447) (← links)
- The complexity of predicate default logic over a countable domain (Q1861328) (← links)
- Default reasoning by deductive planning (Q1896366) (← links)
- Complexity of computing with extended propositional logic programs (Q1924783) (← links)
- On the decidability and complexity of reasoning about only knowing (Q1978243) (← links)
- Autoepistemic answer set programming (Q2046018) (← links)
- Redundancy in logic. III: Non-monotonic reasoning (Q2389660) (← links)
- Defaults with priorities (Q2642474) (← links)
- Multi-modal nonmonotonic logics of minimal knowledge (Q2642626) (← links)
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach (Q2642629) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- Privacy Preservation Using Multi-context Systems and Default Logic (Q2900519) (← links)
- Relating Truth, Knowledge and Belief in Epistemic States (Q3011959) (← links)
