Computing protected circumscription
From MaRDI portal
Publication:3702535
DOI10.1016/S0743-1066(85)80002-9zbMath0579.68054MaRDI QIDQ3702535
Publication date: 1985
Published in: The Journal of Logic Programming (Search for Journal in Brave)
relational algebranonmonotonic reasoningdata basesprotected datapredicate completionHorn dataindefinite data
Abstract data types; algebraic specification (68Q65) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items
Inferring negative information from disjunctive databases, Dynamic reasoning with qualified syllogisms, Protected completions of first-order general logic programs, Relating minimal models and pre-requisite-free normal defaults, On the complexity of data disjunctions., Completeness results for circumscription