scientific article; zbMATH DE number 4166939

MaRDI QIDQ3493327zbMATH OpenFDO

Authors Henry Kautz, Bart Selman

Publication date 1989

zbMATH Keywords

default logicsknowledge basereasoning

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• Hard problems for simple default logics
• The Complexity of Reasoning for Fragments of Default Logic
• scientific article; zbMATH DE number 52991
• scientific article; zbMATH DE number 4106303
• scientific article; zbMATH DE number 408811

Cited in

(38)

• Hard problems for simple default logics
• Logic knowledge bases with two default rules
• Inheritance comes of age: applying nonmonotonic techniques to problems in industry
• On Stein's paper: Resolving ambiguity in nonmonotonic inheritance hierarchies
• Seminormal stratified default theories
• Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions
• Dynamic reasoning with qualified syllogisms
• Semantics and complexity of abduction from default theories
• Default reasoning from conditional knowledge bases: Complexity and tractable cases
• Yet some more complexity results for default logic
• Reasoning with power defaults
• Default reasoning by deductive planning
• The complexity of default reasoning under the stationary fixed point semantics
• Well-founded and stationary models of logic programs
• Connections between default reasoning and partial constraint satisfaction
• Limited reasoning in first-order knowledge bases with full introspection
• Model-preference default theories
• Complexity results for restricted credulous default reasoning
• Complexity results for 2CNF default theories
• On the parameterized complexity of default logic and autoepistemic logic
• scientific article; zbMATH DE number 4174352 (Why is no real title available?)
• Modeling simultaneous events with default reasoning and tight derivations
• The Complexity of Reasoning for Fragments of Default Logic
• Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
• scientific article; zbMATH DE number 4106303 (Why is no real title available?)
• scientific article; zbMATH DE number 52991 (Why is no real title available?)
• scientific article; zbMATH DE number 408811 (Why is no real title available?)
• scientific article; zbMATH DE number 1249652 (Why is no real title available?)
• scientific article; zbMATH DE number 2032416 (Why is no real title available?)
• scientific article; zbMATH DE number 1754690 (Why is no real title available?)
• scientific article; zbMATH DE number 1761409 (Why is no real title available?)
• scientific article; zbMATH DE number 1876863 (Why is no real title available?)
• scientific article; zbMATH DE number 1390355 (Why is no real title available?)
• Two simple characterizations of well-founded semantics
• Reasoning with stratified default theories
• Complexity of Default Logic on Generalized Conjunctive Queries
• Proof complexity of propositional default logic
• The complexity of path-based defeasible inheritance

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3493327)