Equality and Domain Closure in First-Order Databases
From MaRDI portal
Publication:3883571
Cited in
(25)- Applying the persistent set approach in temporal reasoning
- Hybrid reasoning using universal attachment
- Foundations of Onto-Relational Learning
- Formal considerations of rule-based messaging for business process integration
- A logical framework for depiction and image interpretation
- Closed world assumptions having precedence in predicates
- Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning
- Nested abnormality theories
- Nonmonotonicity and the scope of reasoning
- On the expressive power of database queries with intermediate types
- Probabilistic Horn abduction and Bayesian networks
- Parsing as non-Horn deduction
- Closed-world databases and circumscription
- Completeness results for circumscription
- Minimalism, justification and non-monotonicity in deductive databases
- Analysing inconsistent first-order knowledgebases
- Type data bases with incomplete information
- Actors, actions, and initiative in normative system specification
- Saturation, nonmonotonic reasoning and the closed-world assumption
- The open logic and its relation to circumscription
- Proving semantic properties as first-order satisfiability
- Certain answers as objects and knowledge
- Value minimization in circumscription
- Inductive logic programming in databases: from Datalog to \(\mathcal {DL} + \text{LOG}^{\neg \vee}\)
- Only persistence makes nonmonotonicity monotonous (extended abstract)
This page was built for publication: Equality and Domain Closure in First-Order Databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883571)
