Computing circumscriptive databases

DOI10.1006/INCO.1995.1005MaRDI QIDQ1346715zbMATH OpenOpenAlexFDO

Authors V. S. Subrahmanian, Raymond T. Ng, Anil Nerode

Publication date 10 April 1995

Published in Information and Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1006/inco.1995.1005

zbMATH Keywords

circumscriptive databasesquery language

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 4210121
• An algorithm to compute circumscription
• Computing protected circumscription
• Logic Programming
• scientific article; zbMATH DE number 4106291

Cited in

(14)

• An algorithm to compute circumscription
• Inference flexibility in Horn clause knowledge bases and the simplex method
• Computing definite logic programs by partial instantiation
• On compact representations of propositional circumscription
• Is intractability of nonmonotonic reasoning a real drawback?
• Reducing belief revision to circumscription (and vice versa)
• Preprocessing of intractable problems
• scientific article; zbMATH DE number 4210121 (Why is no real title available?)
• Computing protected circumscription
• scientific article; zbMATH DE number 67497 (Why is no real title available?)
• Mixed integer programming methods for computing nonmonotonic deductive databases
• A tableau calculus for minimal model reasoning
• Computing minimal models by partial instantiation
• Reasoning under minimal upper bounds in propositional logic

This page was built for publication: Computing circumscriptive databases

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