Approximate databases: a support tool for approximate reasoning
From MaRDI portal
Recommendations
Cites work
- A kripke-kleene semantics for logic programs*
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Computing circumscription revisited: A reduction algorithm
- Declarative PTIME queries for relational databases using quantifier elimination
- Finite Model Theory
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 3484054 (Why is no real title available?)
- scientific article; zbMATH DE number 1302020 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- On the Correspondence Between Modal and Classical Logic: an Automated Approach
- Sound and efficient closed-world reasoning for planning
- Toward useful type-free theories. I
- Untersuchungen über das Eliminationsproblem der mathematischen Logik
Cited in
(5)- Logical foundations and complexity of 4QL, a query language with unrestricted negation
- scientific article; zbMATH DE number 1071872 (Why is no real title available?)
- scientific article; zbMATH DE number 1487935 (Why is no real title available?)
- Rough Sets and Current Trends in Computing
- Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic
This page was built for publication: Approximate databases: a support tool for approximate reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3647257)