Redundancy in logic. III: Non-monotonic reasoning

DOI10.1016/J.ARTINT.2008.02.003MaRDI QIDQ2389660zbMATHOpenAlexFDO

Authors Paolo Liberatore

Publication date 17 July 2009

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2008.02.003

zbMATH Keywords

computational complexitynonmonotonic reasoningcircumscriptiondefault logiclogical redundancy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other nonclassical logic (03B60) Logic in artificial intelligence (68T27)

Recommendations

• Redundancy in logic. I: CNF propositional formulae
• Redundancy in logic. II: 2CNF and Horn propositional formulae
• The expressive power of circumscription
• A survey of complexity results for non-monotonic logics
• scientific article; zbMATH DE number 67499

Cites work

• scientific article; zbMATH DE number 4104920 (Why is no real title available?)
• scientific article; zbMATH DE number 1292298 (Why is no real title available?)
• scientific article; zbMATH DE number 478394 (Why is no real title available?)
• scientific article; zbMATH DE number 592370 (Why is no real title available?)
• scientific article; zbMATH DE number 194964 (Why is no real title available?)
• scientific article; zbMATH DE number 1884383 (Why is no real title available?)
• A logic for default reasoning
• A logical framework for default reasoning
• Alternative approaches to default logic
• Approximating minimal unsatisfiable subformulae by means of adaptive core search
• Circumscription - a form of non-monotonic reasoning
• Complexity Results for Nonmonotonic Logics
• Eliminating the fixed predicates from a circumscription
• Evaluating the effect of semi-normality on the expressiveness of defaults
• Expressing Default Logic Variants in Default Logic
• Extension and equivalence problems for clause minimal formulae
• Minimal Representation of Directed Hypergraphs
• Minimum Covers in Relational Database Model
• On cumulative default logics
• On the complexity of extension checking in default logic
• Operational concepts of nonmonotonic logics. I: Default logic
• Optimal compression of propositional Horn knowledge bases: Complexity and approximation
• Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Redundancy in logic. I: CNF propositional formulae
• Redundancy in logic. II: 2CNF and Horn propositional formulae
• Removing redundancy from a clause
• Representability in Default Logic
• Saturation, nonmonotonic reasoning and the closed-world assumption
• Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
• Strongly equivalent logic programs
• The Minimization Problem for Boolean Formulas
• The complexity of facets resolved
• Translating default logic into standard autoepistemic logic
• Where fail-safe default logics fail

Cited in

(5)

• Removing Redundancy from Answer Set Programs
• Redundancy in logic. I: CNF propositional formulae
• Algorithms for computing minimal equivalent subformulas
• Redundancy in logic. II: 2CNF and Horn propositional formulae
• Minimal sets on propositional formulae. Problems and reductions

This page was built for publication: Redundancy in logic. III: Non-monotonic reasoning

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