Equality and Domain Closure in First-Order Databases
From MaRDI portal
Publication:3883571
DOI10.1145/322186.322189zbMath0441.68117OpenAlexW2059572526MaRDI QIDQ3883571
Publication date: 1980
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322186.322189
first-order logicequalityrelational databasesprojection operatordivision operatorindefinite answersclosed databasesdeductive question-answeringdefinite answers
Related Items (25)
Closed-world databases and circumscription ⋮ Hybrid reasoning using universal attachment ⋮ Certain answers as objects and knowledge ⋮ Actors, actions, and initiative in normative system specification ⋮ Type data bases with incomplete information ⋮ Analysing inconsistent first-order knowledgebases ⋮ Minimalism, justification and non-monotonicity in deductive databases ⋮ Applying the persistent set approach in temporal reasoning ⋮ Closed world assumptions having precedence in predicates ⋮ Foundations of Onto-Relational Learning ⋮ On the expressive power of database queries with intermediate types ⋮ Nonmonotonicity and the scope of reasoning ⋮ FORMAL CONSIDERATIONS OF RULE-BASED MESSAGING FOR BUSINESS PROCESS INTEGRATION ⋮ Parsing as non-Horn deduction ⋮ Inductive Logic Programming in Databases: From <scp>Datalog</scp> to ⋮ A logical framework for depiction and image interpretation ⋮ Proving semantic properties as first-order satisfiability ⋮ Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning ⋮ Value minimization in circumscription ⋮ Only persistence makes nonmonotonicity monotonous ⋮ The open logic and its relation to circumscription ⋮ Nested abnormality theories ⋮ Saturation, nonmonotonic reasoning and the closed-world assumption ⋮ Probabilistic Horn abduction and Bayesian networks ⋮ Completeness results for circumscription
This page was built for publication: Equality and Domain Closure in First-Order Databases
