Computing circumscriptive databases

DOI10.1006/INCO.1995.1005zbMATH Open0829.68042OpenAlexW1537170873MaRDI QIDQ1346715FDOQ1346715

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

Publication date: 10 April 1995

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

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

Recommendations

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

zbMATH Keywords

query languagecircumscriptive databases

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (13)

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

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)