Pages that link to "Item:Q1185011"
From MaRDI portal
The following pages link to Paraconsistent disjunctive deductive databases (Q1185011):
Displaying 21 items.
- The completeness of gp-resolution for annotated logics (Q1205717) (← links)
- Probabilistic logic programming (Q1207942) (← links)
- The value of the four values (Q1274293) (← links)
- Interpreting disjunctive logic programs based on a strong sense of disjunction (Q1311401) (← links)
- A semantical framework for supporting subjective and conditional probabilities in deductive databases (Q1311410) (← links)
- Duality for goal-driven query processing in disjunctive deductive databases (Q1598444) (← links)
- Quasi-classical reasoning in paraconsistent databases (Q1653451) (← links)
- Reasoning with Uncertainty in Deductive Databases and Logic Programs (Q3114490) (← links)
- (Q3798295) (← links)
- (Q4413444) (← links)
- (Q4413450) (← links)
- On Theorem Proving in Annotated Logics (Q4443407) (← links)
- (Q4736942) (← links)
- Paraconsistent Stable Semantics for Extended Disjunctive Programs (Q4835533) (← links)
- A paraconsistent relational data model (Q4847156) (← links)
- (Q4866586) (← links)
- (Q5018502) (← links)
- (Q5475454) (← links)
- \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\) (Q5946276) (← links)
- \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\) (Q5946327) (← links)
- Automatic theorem proving in paraconsistent logics: Theory and implementation (Q6488523) (← links)
