Computing protected circumscription

DOI10.1016/S0743-1066(85)80002-9MaRDI QIDQ3702535zbMATH OpenFDO

Authors Jack Minker, Donald Perlis

Publication date 1985

Published in The Journal of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

nonmonotonic reasoningrelational algebradata basesprotected datapredicate completionHorn dataindefinite data

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Abstract data types; algebraic specification (68Q65)

Recommendations

• Some computational aspects of circumscription
• An algorithm to compute circumscription
• Computing circumscriptive databases
• scientific article; zbMATH DE number 67498
• Circumscribing embedded implications (without stratifications)

Cited in

(9)

• On the complexity of data disjunctions.
• Inferring negative information from disjunctive databases
• Computing circumscriptive databases
• Some computational aspects of circumscription
• Completeness results for circumscription
• Dynamic reasoning with qualified syllogisms
• Protected completions of first-order general logic programs
• Relating minimal models and pre-requisite-free normal defaults
• Partially defined computer instructions and guards

This page was built for publication: Computing protected circumscription

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