Pages that link to "Item:Q4434614"
From MaRDI portal
The following pages link to Reducing Preferential Paraconsistent Reasoning to Classical Entailment (Q4434614):
Displaying 11 items.
- A solver for QBFs in negation normal form (Q1020501) (← links)
- Four-valued paradefinite logics (Q1685565) (← links)
- Restricted semantics for default reasoning (Q1757453) (← links)
- Galois connections for bilattices (Q2036385) (← links)
- Distance-based paraconsistent logics (Q2270429) (← links)
- A QBF-based formalization of abstract argumentation semantics (Q2446545) (← links)
- Computational methods for database repair by signed formulae (Q2502158) (← links)
- Characterising equilibrium logic and nested logic programs: Reductions and complexity, (Q3181745) (← links)
- An Algorithm for Computing Inconsistency Measurement by Paraconsistent Semantics (Q3524921) (← links)
- Reasoning with different levels of uncertainty (Q3643259) (← links)
- (Q5020976) (← links)