Redundancy in logic. III: Non-monotonic reasoning

DOI10.1016/J.ARTINT.2008.02.003zbMATH Open1183.68598OpenAlexW2119161271MaRDI QIDQ2389660FDOQ2389660

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

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

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)

Cites Work

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

Cited In (5)

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

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)