Enumerating Minimally Revised Specifications Using Dualization

DOI10.1007/11780496_21MaRDI QIDQ3617032zbMATH OpenOpenAlexFDO

Authors Ken Satoh, Takeaki Uno

Publication date 26 March 2009

Published in New Frontiers in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780496_21

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• An algorithm to compute maximal contractions for Horn clauses
• Compilability and compact representations of revision of Horn knowledge bases
• Strong duality in Horn minimization
• Translation-Based Revision and Merging for Minimal Horn Reasoning.
• On the complexity of the dualization problem

Cites work

• Linear-time algorithms for testing the satisfiability of propositional horn formulae

This page was built for publication: Enumerating Minimally Revised Specifications Using Dualization

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