Pages that link to "Item:Q5311203"
From MaRDI portal
The following pages link to Advances in Artificial Intelligence – SBIA 2004 (Q5311203):
Displaying 12 items.
- Tractable approximate deduction for OWL (Q274420) (← links)
- Informational semantics, non-deterministic matrices and feasible deduction (Q281148) (← links)
- Semantics and proof-theory of depth bounded Boolean logics (Q385021) (← links)
- The enduring scandal of deduction. Is propositional logic really uninformative? (Q833033) (← links)
- Cut and pay (Q851192) (← links)
- An informational view of classical logic (Q897935) (← links)
- Polynomial algorithm of limited propositional deduction (Q1962496) (← links)
- The universe of propositional approximations (Q2369011) (← links)
- Anytime Approximations of Classical Logic from Above (Q3437258) (← links)
- Does This Set of Clauses Overlap with at Least One MUS? (Q5191099) (← links)
- Logics in Artificial Intelligence (Q5394150) (← links)
- A first polynomial non-clausal class in many-valued logic (Q6083144) (← links)