Computing protected circumscription

From MaRDI portal

Revision as of 08:52, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3702535

Jump to:navigation, search

DOI10.1016/S0743-1066(85)80002-9zbMath0579.68054MaRDI QIDQ3702535

Jack Minker, Donald Perlis

Publication date: 1985

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

zbMATH Keywords

relational algebra nonmonotonic reasoning data bases protected data predicate completion Horn data indefinite data

Mathematics Subject Classification ID

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

Related Items (6)

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

This page was built for publication: Computing protected circumscription

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3702535&oldid=17193727"