scientific article; zbMATH DE number 1149451

MaRDI QIDQ4386975zbMATH OpenFDO

Authors G. Gogic, Christos Papadimitriou, Martha Sideri

Publication date 13 May 1998

zbMATH Keywords

Horn formulasincremental recompilation

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• Compilability and compact representations of revision of Horn knowledge bases
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Knowledge compilation and theory approximation
• Update by means of inference rules
• Belief revision in Horn theories

Cited in

(12)

• Compilability and compact representations of revision of Horn knowledge bases
• On the complexity of monotone dualization and generating minimal hypergraph transversals
• The size of a revised knowledge base
• The complexity of theory revision
• Successive refinement of information
• Semantical and computational aspects of Horn approximations
• Information loss in knowledge compilation: a comparison of Boolean envelopes
• Achieving new upper bounds for the hypergraph duality problem through logic
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling
• Resolution based algorithms for the transversal hypergraph generation problem
• On the difference of Horn theories
• Belief revision within fragments of propositional logic

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 Q4386975)